ACM Home Page
Please provide us with feedback. Feedback
Can recursive bisection alone produce routable placements?
Full text PdfPdf (106 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 477 - 482  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Andrew E. Caldwell  UCLA Computer Science Dept., Los Angeles, CA
Andrew B. Kahng  UCLA Computer Science Dept., Los Angeles, CA
Igor L. Markov  UCLA Computer Science Dept., Los Angeles, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 38,   Citation Count: 124
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/337292.337549
What is a DOI?

ABSTRACT

This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the state-of-the-art after two decades of research in recursive bisection placement and implement a new placer, called Capo, to empirically study the achievable limits of the approach. From among recently proposed improvements to recursive bisection, Capo incorporates a leading-edge multilevel min-cut partitioner [7], techniques for partitioning with small tolerance [8], optimal min-cut partitioners and end-case min-wirelength placers [5], previously unpublished partitioning tolerance computations, and block splitting heuristics. On the other hand, our “good enough” implementation does not use “overlapping” [17], multi-way partitioners [17, 20], analytical placement, or congestion estimation [24, 35]. In order to run on recent industrial placement instances, Capo must take into account fixed macros, power stripes and rows with different allowed cell orientations. Capo reads industry-standard LEF/DEF, as well as formats of the GSRC bookshelf for VLSI CAD algorithms [6], to enable comparisons on available placement instances in the fixed-die regime.Capo clearly demonstrates that despite a potential mismatch of objectives, improved mincut bisection can still lead to improved placement wirelength and congestion. Our experiments on recent industrial benchmarks fail to give a clear answer to the question in the title of this paper. However, they validate a series of improvements to recursive bisection and point out a need for transparent congestion management techniques that do not worsen the wirelength of already routable placements. Our experimental flow, which validates fixed-die placement results by violation-free detailed auto-routability, provides a new norm for comparison of VLSI placement implementations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
M.A. Breuer, "Min-Cut Placement", J. Design Autom. and Fault- Tolerant Comp. 1(4) (1977), pp. 343-362.
4
5
 
6
A. E. Caldwell, A. B. Kahng and I. L. Markov, "VLSI CAD bookshelf", 1999, http ://vlsicad. cs. ucla. edu/GSRC/bookshelf/
7
 
8
A. E. Caldwell, A. B. Kahng and I. L. Markov, "Iterative Partitioning With Varying Node Weights", to appear in VLSI Design, 2000.
 
9
A. E. Caldwell and I. L. Markov, "Hierarchical Whitespace Allocation", Technical Report TR-200002, UCLA Computer Science Dept., 2000.
 
10
C. K. Cheng and E. S. Kuh. "Module Placement Based on Resistive Network Optimization", IEEE Trans. on Computer Aided Design 3 (1984), pp. 218-225.
 
11
 
12
K. Doll, F. M. Johannes, K. J. Antreich, "Iterative Placement Improvement by Network Flow Methods", IEEE Transactions on Computer-Aided Design 13(10) (1994), pp. 1189-1200.
 
13
A. E. Dunlop and B. W. Kernighan, "A Procedure for Placement of Standard Cell VLSI Circuits", IEEE Transactions on Computer- Aided Design 4(1) (1985), pp. 92-98.
 
14
15
 
16
17
18
19
20
 
21
J. Kleinhans, G. Sigl, F. Johannes and K. Antreich, "GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization", IEEE Transactions on Computer-Aided Design 10(3) (1991), pp. 356-365.
22
23
24
25
 
26
A. Srinivasan, K. Chaudhary and E. S. Kuh, "RITUAL: A Performance Driven Placement for Small-Cell ICs", ICCAD '91, pp. 48-51.
 
27
E R. Suaris and G. Kedem, "Quadrisection: A New Approach to Standard Cell Layout", ICCAD '87, pp. 474-477.
 
28
29
 
30
K. Takahashi, K. Nakajima, M. Terai and K. Sato, "Min-Cut Placement With Global Objective Functions for Large Scale Seaof-Gates Arrays", IEEE Transactions on Computer-Aided Design 14(4) (1995), pp. 434-446.
 
31
 
32
E Villarrubia, G. Nusbaum, R. Masleid and ET. Patel, "IBM RISC Chip Design Methodology", ICCD '89, pp. 143-147.
 
33
E Villarrubia, personal communication, 2000.
34
35
36
 
37

CITED BY  124

Collaborative Colleagues:
Andrew E. Caldwell: colleagues
Andrew B. Kahng: colleagues
Igor L. Markov: colleagues