A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Efficient network flow based min-cut balanced partitioning
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
A probability-based approach to VLSI circuit partitioning
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Genetic algorithms for VLSI design, layout & test automation
Genetic algorithms for VLSI design, layout & test automation
Multilevel k-way hypergraph partitioning
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Spectral partitioning with multiple eigenvectors
Discrete Applied Mathematics - Special volume on VLSI
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Improved algorithms for hypergraph bipartitioning
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
An Efficient Practical Heuristic For Good Ratio-Cut Partitioning
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Hi-index | 0.01 |
We present a new efficient heuristic that finds good ratio-cut bipartitions of hypergraphs that model large VLSI netlists. Ratio cut measure is given by the ratio of the number of nets cut between two blocks and the product of the cardinality (size) of each block. Hypergraphs model VLSI netlists in a more natural fashion than do graphs. Our new heuristic may be considered a hybrid between the approaches of [10] and [12]. It makes use of maxflow-mincut algorithm as a subroutine that is invoked only a (small) constant number of times. Comparisons with the state-of-art partitioners such as hmetis [6](hmetis was run several times to yield min-cuts for diffently balanced bipartitions) show that the heuristic successfully finds better ratio-cut bipartitions in most of the cases. Although maxflow-mincut algorithms are theoretically slower than multilevel algorithm of hmetis the actual running times of our heuristic is found to be of the same order. The experiments have been conducted on ISPD98 benchmarks of sizes upto 200K cells.