ACM Home Page
Please provide us with feedback. Feedback
Consistent placement of macro-blocks using floorplanning and standard-cell placement
Full text PdfPdf (1.60 MB)
Source International Symposium on Physical Design archive
Proceedings of the 2002 international symposium on Physical design table of contents
San Diego, CA, USA
SESSION: Placement table of contents
Pages: 12 - 17  
Year of Publication: 2002
ISBN:1-58113-460-6
Authors
Saurabh N. Adya  University of Michigan, Ann Arbor, MI
Igor L. Markov  University of Michigan, Ann Arbor, MI
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 22,   Citation Count: 28
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/505388.505392
What is a DOI?

ABSTRACT

While a number of recent works address large-scale standard-cell placement, they typically assume that all macros are fixed. Floorplanning techniques are very good at handling macros, but do not scale to hundreds of thousands of placeable objects. Therefore we combine floorplanning techniques with placement techniques in a design flow that solves the more general placement problem. Our work shows how to place macros consistently with large numbers of small standard cells. Our techniques can also be used to guide circuit designers who prefer to place macros by hand.

The proposed flow relies on an arbitrary black-box standard-cell placer to obtain an initial placement and then removes possible overlaps using a fixed-outline floorplanner. This results in valid placements for macros, which are considered fixed. Remaining standard cells are then placed by another call to the standard-cell placer. Empirical evaluation on ibm benchmarks shows, in most cases, wirelength improvements of 10%-50% compared to Cadence QPlace, as well as runtime improvements.


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
 
4
Cadence Inc, "Openbook documentation for QPlace", QP version 5.1.67 10/27/2000.
5
 
6
A. E. Caldwell, A. B. Kahng, I. L. Markov, "Optimal Partitioners and End-case Placers for Standard-cell Layout", IEEE Trans. on CAD, vol. 19, no. 11, 2000, pp. 1304--1314.
 
7
A. E. Caldwell, A. B. Kahng, I. L. Markov, "VLSI CAD Bookshelf" http://vlsicad.eecs.umich.edu/BK
 
8
K. Doll, F. M. Johannes and K. J. Antreich, "Iterative Placement Improvement By Network Flow Methods". IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol.13, (no.10), Oct. 1994. pp. 1189--1200.
 
9
S. Dutt, "Effective Partition-Driven Placement with Simultaneous Level Processing and a Global Net Views", ICCAD 2000, p. 254.
10
11
12
 
13
 
14
H. Murata, K. Fujiyoshi, S. Nakatake and Y. Kajitani, "VLSI module placement based on rectangle-packing by the sequence pair", IEEE Trans. on CAD, vol 15(12), pp. 1518--1524, 1996.
 
15
16
17
 
18
 
19
M. C. Yildiz and P. H. Madden, "Improved Cut Sequences for Partitioning Based Placement", DAC 2001.

CITED BY  28

Collaborative Colleagues:
Saurabh N. Adya: colleagues
Igor L. Markov: colleagues