| Congestion driven quadratic placement |
| Full text |
Pdf
(216 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 35th annual Design Automation Conference
table of contents
San Francisco, California, United States
Pages: 275 - 278
Year of Publication: 1998
ISBN:0-89791-964-5
|
|
Authors
|
|
Phiroze N. Parakh
|
University Of Michigan, 1301 Beal Ave, EECS - ACAL, Ann Arbor, MI
|
|
Richard B. Brown
|
University Of Michigan, 1301 Beal Ave, EECS - ACAL, Ann Arbor, MI
|
|
Karem A. Sakallah
|
University Of Michigan, 1301 Beal Ave, EECS - ACAL, Ann Arbor, MI
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 36
|
|
|
ABSTRACT
This paper introduces and demonstrates an extension to quadratic placement that accounts for wiring congestion. The algorithm uses an A* router and line-probe heuristics on region-based routing graphs to compute routing cost. The interplay between routing analysis and quadratic placement using a growth matrix permits global treatment of congestion. Further reduction in congestion is obtained by the relaxation of pin constraints. Experiments show improvements in wireability.
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
|
Kenneth D. Boese , Andrew B. Kahng , Gabriel Robins, High-performance routing trees with identified critical sinks, Proceedings of the 30th international conference on Design automation, p.182-187, June 14-18, 1993, Dallas, Texas, United States
[doi> 10.1145/157485.164662]
|
 |
3
|
|
| |
4
|
E.S. David et. al, "Meshach: Matrix Computations in C". Proceedings of the Center forMathematics and its Applications. Australian National University, vol. 32, 1994.
|
| |
5
|
G.H. Golub et. al, "Matrix computations", The Johns Hopkins University Press, 2nd ed.
|
 |
6
|
Georg Sigl , Konrad Doll , Frank M. Johannes, Analytical placement: A linear or a quadratic objective function?, Proceedings of the 28th conference on ACM/IEEE design automation, p.427-432, June 17-22, 1991, San Francisco, California, United States
[doi> 10.1145/127601.127707]
|
| |
7
|
J.M. Kleinhans et. al, "GORDIAN: VLSI placement by quadratic programming and slicing optimization". 1991 IEEE TCADICS, vol. 10, no.3, pp. 356-5.
|
| |
8
|
P.R. Suaris et. al, "A quadrisection-based combined place and route scheme for standard cells".1989 IEEETCADICS, vol.8, no.3, pp. 234-244.
|
| |
9
|
Ren-Song Tsay , Ernest S. Kuh , Chi-Ping Hsu, Proud: a fast sea-of-gates placement algorithm, Proceedings of the 25th ACM/IEEE conference on Design automation, p.318-323, June 12-15, 1988, Atlantic City, New Jersey, United States
|
| |
10
|
S.-Mayrhofer et. al,"Congestlon-driven placement using a new multi-partitioning heuristic".IEEE ICCAD 90, pp. -332-5.
|
| |
11
|
S. Prasitjutrakul et. al,"A timinlg-driven global router for custom chip design". 19901EEEICCAD, pp. 48-51.
|
| |
12
|
S. Yousef, "Iterative methods for sparse linear systems". PWS Publishing Company.
|
| |
13
|
W. Dongsheng et. al, "Performance-driven interconnect global routing .Proc. 6th GreatLakesSymp'~nVLSl' pp. 132-6.
|
| |
14
|
Y. Saab, "A fast clustering-based min-cut placement algorithm with simulated-annealing performance". 199~LSI Design, vol.5, no.l, pp. 37-48.
|
CITED BY 36
|
|
Jinan Lou , Shankar Krishnamoorthy , Henry S. Sheng, Estimating routing congestion using probabilistic analysis, Proceedings of the 2001 international symposium on Physical design, p.112-117, April 01-04, 2001, Sonoma, California, United States
|
|
|
|
|
|
Xiaojian Yang , Ryan Kastner , Majid Sarrafzadeh, Congestion estimation during top-down placement, Proceedings of the 2001 international symposium on Physical design, p.164-169, April 01-04, 2001, Sonoma, California, United States
|
|
|
Andrew E. Caldwell , Andrew B. Kahng , Igor L. Markov, Can recursive bisection alone produce routable placements?, Proceedings of the 37th conference on Design automation, p.477-482, June 05-09, 2000, Los Angeles, California, United States
|
|
|
|
|
|
Maogang Wang , Xiaojian Yang , Kenneth Eguro , Majid Sarrafzadeh, Multi-center congestion estimation and minimization during placement, Proceedings of the 2000 international symposium on Physical design, p.147-152, May 2000, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Saurabh N. Adya , Mehmet C. Yildiz , Igor L. Markov , Paul G. Villarrubia , Phiroze N. Parakh , Patrick H. Madden, Benchmarking for large-scale placement and beyond, Proceedings of the 2003 international symposium on Physical design, April 06-09, 2003, Monterey, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Taraneh Taghavi , Foad Dabiri , Ani Nahapetian , Majid Sarrafzadeh, Tutorial on congestion prediction, Proceedings of the 2007 international workshop on System level interconnect prediction, March 17-18, 2007, Austin, Texas, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Wenting Hou , Hong Yu , Xianlong Hong , Yici Cai , Weimin Wu , Jun Gu , William H. Kao, A new congestion-driven placement algorithm based on cell inflation, Proceedings of the 2001 conference on Asia South Pacific design automation, p.605-608, January 2001, Yokohama, Japan
|
|
|
|
|
|
|
|
|
Fei He , Xiaoyu Song , Ming Gu , Lerong Cheng , Guowu Yang , Zhiwei Tang , Jiaguang Sun, A combinatorial congestion estimation approach with generalized detours, Computers & Mathematics with Applications, v.51 n.6-7, p.1113-1126, March, 2006
|
INDEX TERMS
Primary Classification:
B.
Hardware
B.7
INTEGRATED CIRCUITS
B.7.2
Design Aids
Subjects:
Placement and routing
Additional Classification:
B.
Hardware
B.7
INTEGRATED CIRCUITS
B.7.1
Types and Design Styles
Subjects:
VLSI (very large scale integration)
B.8
Performance and Reliability
C.
Computer Systems Organization
G.
Mathematics of Computing
G.4
MATHEMATICAL SOFTWARE
Subjects:
Algorithm design and analysis
I.
Computing Methodologies
I.2
ARTIFICIAL INTELLIGENCE
I.2.8
Problem Solving, Control Methods, and Search
Subjects:
Heuristic methods
General Terms:
Algorithms,
Design,
Experimentation,
Measurement,
Performance,
Theory
Keywords:
congestion,
global routing,
quadratic placement,
relaxed pins,
routing models,
supply-demand
|