Multilevel circuit partitioning

  • Authors:
  • Charles J. Alpert;Jen-Hsin Huang;Andrew B. Kahng

  • Affiliations:
  • UCLA Computer Science Department, Los Angeles, CA and IBM Austin Research Laboratory, Austin, TX;UCLA Computer Science Department, Los Angeles, CA and Synopsys, Inc., Mountain View, CA;UCLA Computer Science Department, Los Angeles, CA and Cadence Design Systems, Inc., San Jose, CA

  • Venue:
  • DAC '97 Proceedings of the 34th annual Design Automation Conference
  • Year:
  • 1997

Quantified Score

Hi-index 0.01

Visualization

Abstract

Recent work has illustrated the promise ofmultilevel approaches for partitioning large circuits. Multilevel partitioningrecursively clusters the instance until its size is smallerthan a given threshold, then unclusters the instance while applyinga partitioning refinement algorithm. Our multilevel partitioner usesa new technique to control the number of levels in the matching-basedclustering phase and also exploits recent innovations in classiciterative partitioning. Our heuristic outperforms numerousexisting bipartitioning heuristics, with improvements rangingfrom 6.9 to 27.9% for 100 runs and 3.0 to 20.6% for just 10 runs(while also using less CPU time).