| Algorithms for simultaneous satisfaction of multiple constraints and objective optimization in a placement flow with application to congestion control |
| Full text |
Pdf
(263 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 39th annual Design Automation Conference
table of contents
New Orleans, Louisiana, USA
SESSION: Floorplanning and placement
table of contents
Pages: 854 - 859
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
|
|
Authors
|
|
Ke Zhong
|
University of Illinois at Chicago, Chicago, IL
|
|
Shantanu Dutt
|
University of Illinois at Chicago, Chicago, IL
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 13, Citation Count: 2
|
|
|
ABSTRACT
This paper addresses the problem of tackling multiple constraints simultaneously during a partitioning driven placement (PDP) process, where a larger solution space is available for constraint-satisfying optimization compared to post placement methods. A general methodology of multi-constraint satisfaction that balances violation correction and primary optimization is presented. A number of techniques are introduced to ensure its convergence and enhance its solution search capability with intermediate relaxation. Application of our approach to congestion control modeled as pin density and external net distribution balance constraints shows it effectively reduces overall congestion by 14.3% and improves chip area by 8.9%, with reasonable running time and only 1.6% increase in wire length. As far as we know, this is the first time an approach to congestion reduction during placement optimization produced good congestion improvement with very small wire length increase.
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
|
A. E. Dunlop and B. W. Kernighan. A procedure for placement of standard-cell VLSI circuits. IEEE Trans. CAD, pp. 92--98, Jan. 1985
|
| |
2
|
S. Dutt and W. Deng, "Probability-based Approaches to VLSI Circuit Partitioning," IEEE Trans. CAD, pp. 534--549, Mar. 2000
|
| |
3
|
|
 |
4
|
|
| |
5
|
H. Esbensen and E. Kuh, "Exploring the design space for building block placements considering area, aspect ratio, path delay and routing congestion", Proc. Physical Design Workshop, 1996, pp. 126--133
|
 |
6
|
|
 |
7
|
Roman Kužnar , Franc Brglez , Krzysztof Kozminski, Cost minimization of partitions into multiple devices, Proceedings of the 30th international conference on Design automation, p.315-320, June 14-18, 1993, Dallas, Texas, United States
[doi> 10.1145/157485.164910]
|
| |
8
|
S. Mayrhofer and U. Lauther, "Congestion-driven placement using a new multi partitioning heuristic", Proc. ICCAD, pp. 332--335, 1990
|
 |
9
|
Phiroze N. Parakh , Richard B. Brown , Karem A. Sakallah, Congestion driven quadratic placement, Proceedings of the 35th annual conference on Design automation, p.275-278, June 15-19, 1998, San Francisco, California, United States
[doi> 10.1145/277044.277121]
|
| |
10
|
W-J. Sun and C. Sechen, "Efficient and Effective Placement for Very Large Circuits", IEEE Trans. CAD, pp. 349--359, Mar. 1995
|
| |
11
|
|
| |
12
|
M. Wang, X. Yang and M. Sarrafzadeh, "Congestion Minimization During Placement", IEEE Trans. CAD, pp. 1140--1148, Oct. 2000
|
| |
13
|
|
| |
14
|
|
| |
15
|
|
 |
16
|
|
|