Multilevel Circuit Partitioning

Recent work [2] [5] [ l l ] [12] [14] has illustrated the promise of multilevel approaches for partitioning large circuits. Multilevel partitioning recursively clusters the instance until its size is smaller than a given threshold, then unclusters the instance while applying a partitioning refinement algorithm. Our multilevel partitioner uses a new technique to control the number of levels in the matchingbased clustering phase and also exploits recent innovations in classic iterative partitioning 171 [IO]. Our heuristic outperforms numerous existing bipartitioning heuristics, with improvements ranging from 6.9 to 27.9% for 100 runs and 3.0 to 20.6% for just 10 runs (while also using less CPU time).

[1]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[2]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[3]  Frank Thomson Leighton,et al.  Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  Konrad Doll,et al.  Partitioning Very Large Circuits Using Analytical Placement Techniques , 1994, 31st Design Automation Conference.

[5]  Alok N. Choudhary,et al.  Graph Contraction for Mapping Data on Parallel Computers: A Quality-Cost Tradeoff , 1994, Sci. Program..

[6]  Vipin Kumar,et al.  Multilevel Graph Partitioning Schemes , 1995, ICPP.

[7]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[8]  Chung-Kuan Cheng,et al.  A gradient method on the initial partition of Fiduccia-Mattheyses algorithm , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[9]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[10]  Dennis J.-H. Huang,et al.  On implementation choices for iterative improvement partitioning algorithms , 1995, Proceedings of EURO-DAC. European Design Automation Conference.

[11]  Chung-Kuan Cheng,et al.  Linear decomposition algorithm for VLSI design applications , 1995, International Conference on Computer Aided Design.

[12]  Andrew B. Kahng,et al.  A hybrid multilevel/genetic approach for circuit partitioning , 1996, Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems.

[13]  C. Alpert,et al.  Multi-way graph and hypergraph partitioning , 1996 .

[14]  Alex Fukunaga,et al.  Large-step Markov chain variants for VLSI netlist partitioning , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[15]  S. Dutt,et al.  A probability-based approach to VLSI circuit partitioning , 1996, 33rd Design Automation Conference Proceedings, 1996.

[16]  S. Dutt,et al.  VLSI circuit partitioning by cluster-removal using iterative improvement techniques , 1996, Proceedings of International Conference on Computer Aided Design.

[17]  Andrew B. Kahng,et al.  Partitioning-based standard-cell global placement with an exact objective , 1997, ISPD '97.