Multiple-Way Network Partitioning
IEEE Transactions on Computers
Optimal replication for min-cut partitioning
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Optimal clustering for delay minimization
DAC '93 Proceedings of the 30th international Design Automation Conference
Modern heuristic techniques for combinatorial problems
Multiple-Way Network Partitioning with Different Cost Functions
IEEE Transactions on Computers
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Future Generation Computer Systems - Special issue: Bio-inspired solutions to parallel processing problems
A fast hypergraph min-cut algorithm for circuit partitioning
Integration, the VLSI Journal
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Circuit clustering for delay minimization under area and pin constraints
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Network-flow-based multiway partitioning with area and pin constraints
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
GRCA: a hybrid genetic algorithm for circuit ratio-cut partitioning
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimal min-area min-cut replication in partitioned circuits
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
| Hi-index | 0.00 |
Network flow is an excellent approach to finding min-cuts in network because of the celebrated max-flow/min-cut theorem. For a long time, however, it has not been a practical circuit partitioning method for its relatively high computational complexity. Algorithm FBB is the first one to apply network flow to solve two-way balanced circuit partitioning successfully. Later, its improved version DMC efficiently solved the problem of multi-way circuit partitioning. In this paper, an improved circuit-partitioning algorithm MCER is presented. MCER is based on a min-cut equivalence relation. The algorithm not only inherits to take advantage of flow theory, but also incorporates a subsets movement-based method to utilize internal equivalent topological structure of circuit. Based on the equivalence relation and subsets movement between initial min-cuts, MCER will find more min-cuts. A series of experiments demonstrate that searching space of MCER is bigger than that of former algorithms and MCER outperforms FBB or DMC in terms of the size of min-cuts. Furthermore, MCER will degrade to DMC or FBB under special conditions.