| Greedy wire-sizing is linear time |
| Full text |
Pdf
(739 KB)
|
| Source
|
International Symposium on Physical Design
archive
Proceedings of the 1998 international symposium on Physical design
table of contents
Monterey, California, United States
Pages: 39 - 44
Year of Publication: 1998
ISBN:1-58113-021-X
|
|
Authors
|
|
Chris C. N. Chu
|
Department of Computer Sciences, University of Texas at Austin, Austin, TX
|
|
D. F. Wong
|
Department of Computer Sciences, University of Texas at Austin, Austin, TX
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 11, Citation Count: 1
|
|
|
ABSTRACT
In interconnect optimization by wire-sizing, minimizing weighted sink delay has been shown to be the key problem. Wire-sizing with many important objectives such as minimizing total area subject to delay bounds or minimizing maximum delay can all be reduced to solving a sequence of weighted sink delay problems by Lagrangian relaxation [1, 3]. GWSA, first introduced in [10] for discrete wire-sizing and later extended in [2] to continuous wire-sizing, is a greedy wire-sizing algorithm for the weighted sink delay problem. Although GWSA has been experimentally shown to be very efficient, no mathematical analysis on its convergence rate has ever been reported. In this paper, we consider GWSA for continuous wire sizing. We prove that GWSA converges linearly to the optimal solution, which implies that the run time of GWSA is linear with respect to the number of wire segments for any fixed precision of the solution. Moreover, we also prove that this is true for any starting solution. This is a surprising result because previously it was believed that in order to guarantee convergence, GWSA had to start from a solution in which every wire segment is set to the minimum (or maximum) possible width. Our result implies that GWSA can use a good starting solution to achieve faster convergence. We demonstrate this point by showing that the minimization of maximum delay using Lagrangian relaxation can be speed up by 57.7%.
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
|
Chung-Ping Chen , Yao-Wen Chang , D. F. Wong, Fast performance-driven optimization for buffered clock trees based on Lagrangian relaxation, Proceedings of the 33rd annual conference on Design automation, p.405-408, June 03-07, 1996, Las Vegas, Nevada, United States
[doi> 10.1145/240518.240596]
|
| |
2
|
Chung-Ping C'hen and D. F. Wong. A fast Mgorithm for optimal wire-sizing under Elmore delay model. In Proc. IEEE ISCAS, volume 4, pages 412-415, 1996.
|
| |
3
|
Chung-Ping Chen , Hai Zhou , D. F. Wong, Optimal non-uniform wire-sizing under the Elmore delay model, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.38-43, November 10-14, 1996, San Jose, California, United States
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
J. Cong , C. Koh , K. Leung, Simultaneous buffer and wire sizing for performance and power optimization, Proceedings of the 1996 international symposium on Low power electronics and design, p.271-276, August 12-14, 1996, Monterey, California, United States
|
| |
10
|
|
| |
11
|
W. G. Elmore. The transient response of damped linear network with particular regard to wideband amplifiers. J. Applied Physics, 19:55--63, 1948.
|
| |
12
|
1t. S. Tsay. An exact zero-skew clock routing algorithm. IEEE Trans. Computer-Aided Design, 12(2):242-249, February 1993.
|
|