Replication for logic bipartitioning

Authors:
Morgan Enos;Scott Hauck;Majid Sarrafzadeh
Affiliations:
Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL;Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL;Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL
Venue:
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 14
Cited 3

A linear-time heuristic for improving network partitions

25 years of DAC Papers on Twenty-five years of electronic design automation
Introduction to algorithms

Introduction to algorithms
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
Partitioning very large circuits using analytical placement techniques

DAC '94 Proceedings of the 31st annual Design Automation Conference
Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal
Spectral partitioning: the more eigenvectors, the better

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
New algorithms for min-cut replication in partitioned circuits

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Multi-FPGA systems

Multi-FPGA systems
A probability-based approach to VLSI circuit partitioning

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An evaluation of bipartitioning techniques

ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
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

Data security for Web-based CAD

DAC '98 Proceedings of the 35th annual Design Automation Conference
Further improve circuit partitioning using GBAW logic perturbation techniques

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2001 international conference on computer design (ICCD)
Eliminating wire crossings for molecular quantum-dot cellular automata implementation

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a better understanding of the important issues in logic replication. By developing new optimizations to existing algorithms we are able to significantly improve the quality of these techniques, achieving up to 12.5% better results than the best existing replication techniques. When integrated into our already state-of-the-art partitioner, we improve overall cutsizes by 37.8%, while requiring the duplication of at most 7% of the logic.