MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Effective partition-driven placement with simultaneous level processing and global net views (2000) [6 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Ke Zhong, Shantanu Dutt
In Proc. Int. Conf. on Computer Aided Design
http://www.ece.uic.edu/~dutt/././papers/iccad-2000.ps
Add To MetaCart

Abstract:

Abstract: In this paper we take a fresh look at the partition-driven placement (PDP) paradigm for standard-cell placement for wire-length minimization. The goal is to develop several new algorithms for incorporation into a PDP framework that can rectify the well-known drawbacks of traditional PDP (increasingly localized view of nets with increasing levels of the partitioning tree, min-cut objective, inaccuracy and cost of terminal propagation (TP), irreversibility of move decisions), while preserving its considerable advantages (time efficiency, flexibility in accurately incorporating many optimization metrics, and flexibility in satisfying most constraints). We have developed several novel techniques within a PDP-based framework that yield the best wire-length results so far on all but two of the MCNC benchmark suite. Our major innovations are: (1) simultaneous level partitioning (SLP) in which we partition the entire circuit globally in every level of the partitioning tree, across the current cutline(s); (2) cell gain computation based on a global or distributed view of entire nets (thus obviating TP) and on the bounding-box (BB) minimization of nets (as opposed to mincut in prior PDP); (3) move irreversibility tackled in a post-processing phase via vertical and horizontal swaps. Empirical results indicate that our PDP algorithm SPADE (for Simultaneous level PArtitioning with Distributed [i.e., global] nEt views) provides almost 20 % better wirelength results than an internal version of "regular " PDP with min-cut based gains, 10.8 % better than the previous best PDP method QUAD, 10.6 % better than TimberWolf (TW) 7.0, 15.8 % better than the state-of-the-art force-directed technique from U. Munich (termed FD-98 here), and 15.3 % better than the multilevel placement technique Snap-On. Besides TW7.0, we are also the only ones to report results on the approximately 100K-cell circuit golem3 (12.2 % better than TW7.0). Our run times are quite reasonable.

Citations

170 Recent directions in netlist partitioning: A survey – Alpert, Kahng - 1995
159 Multilevel hypergraph partitioning: Application – Karypis, Aggarwal, et al. - 1997
145 GORDIAN: VLSI placement by quadratic programming and slicing optimization – Kleinhans, Sigl, et al. - 1991
113 Generic Global Placement and Floorplanning – Eisenmann, Johannes - 1998
90 Efficient and Effective Placement for Very Large Circuits – Sun, Sechen - 1995
74 VLSI Placement and Global Routing Using Simulated Annealing – Sechen - 1988
68 Multilevel circuit partitioning – Alpert, Huang, et al. - 1998
55 VLSI circuit partitioning by cluster-removal using iterative improvement techniques – Dutt, Deng - 1996
54 A Procedure for Placement of Standard Cell VLSI Circuits – Dunlop, Kernighan - 1985
44 Mattheyses, "A Linear-Time Heuristic for Improving Network Partitions – Fiduccia, M - 1982
40 Partitioning-Based Standard-Cell Global Placement with an Exact Objective – Huang, Kahng - 1997
39 Analytical Placement: A Linear or a Quadratic Objective Function – Sigl, Doll, et al. - 1991
37 Probability-Based Approaches to VLSI Circuit Partitioning – Dutt, Deng
36 A Class of Min-Cut Placement Algorithms – Breuer - 1977
29 A.: On wirelength estimations for row-based placement – Caldwell, Kahng, et al. - 1998
19 An Algorithm for Quadrisection and Its Application to Standard Cell Placement – Suaris, Kedem - 1988
5 PRO: an Automatic String Placement Program for Polycell Layout – Persky - 1976
5 A Snap-On Placement Tool – Yang, Wang, et al. - 2000