ACM Home Page
Please provide us with feedback. Feedback
An effective congestion driven placement framework
Full text PdfPdf (810 KB)
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: 6 - 11  
Year of Publication: 2002
ISBN:1-58113-460-6
Authors
Ulrich Brenner  University of Bonn, Germany
André Rohe  University of Bonn, Germany
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 31,   Citation Count: 27
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.505391
What is a DOI?

ABSTRACT

We present a fast but reliable way to detect routing criticalities in VLSI chips. In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. Different to previous approaches, we do not rerun parts of the placement algorithm or apply a post-placement optimization, but we use our congestion estimator for a dynamic avoidance of routability problems in one single run of the placement algorithm. Computational experiments on chips with up to 1,300,000 cells are presented: The framework reduces the usage of the most critical routing edges by 9.0% on average, the running time increase for the placement is about 8.7%. However, due to the smaller congestion, the running time of routing tools can be decreased drastically, so the total time for placement and (global) routing is decreased by 47% on average.


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
C. Albrecht. Global routing by new approximation algorithms for multicommodity flow. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20:622--632, 2001.
2
 
3
4
5
6
 
7
8
 
9
S. Mayrhofer and U. Lauther. Congestion-driven placement using a new multi-partitioning heuristic. In ICCAD-90, pages 332--335. IEEE Computer Society Press, 1990.
10
 
11
 
12
 
13
C. Sechen. VLSI Placement and Global Routing Using Simulated Annealing. Kluwer, 1988.
 
14
15
16
17
18
 
19
 
20
M. Wang, X. Yang, and M. Sarrafzadeh. Dragon2000: Standard-cell placement tool for large industry designs, 2000.
 
21
22
23

CITED BY  27

Collaborative Colleagues:
Ulrich Brenner: colleagues
André Rohe: colleagues