Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead

Authors:
Wai-Kei Mak
Affiliations:
Department of Computer Science and Engineering, University of South Florida, 4202 E. Fowler Avenue, ENB 118, Tampa, Florida
Venue:
Proceedings of the 2001 international symposium on Physical design
Year:
2001

Citing 9
Cited 0

Efficient network flow based min-cut balanced partitioning

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Multi-way netlist partitioning into heterogeneous FPGAs and minimization of total device cost and interconnect

DAC '94 Proceedings of the 31st annual Design Automation Conference
Multiple FPGA partitioning with performance optimization

FPGA '95 Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays
New algorithms for min-cut replication in partitioned circuits

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Minimum replication min-cut partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Evaluation and optimization of replication algorithms for logic bipartitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Min-cut replication in partitioned networks

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A replication cut for two-way partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic replication is known to be an effective technique to reduce the number of cut nets in partitioned circuits. A new replication model calledfunctional replicationis particularly useful for partitioning technology mapped circuits [7]. Functional replication differs from traditional replication because it considers the functional dependency of the different output signals of a logic cell on its input signals. Functional replication can lead to a higher reduction in the number of cut nets than traditional replication. In this paper, we give the first theoretical treatment of the min-cut partitioning problem with functional replication. We present a novel two-phase algorithm to compute a min-cut bipartition of a technology mapped circuit with functional replication using minimum amount of area overhead. And we show that our algorithm can be applied to improve the solution produced by any area-constrained functional replication partitioning heuristic.