| Fast min-cost buffer insertion under process variations |
| Full text |
Pdf
(214 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 44th annual Design Automation Conference
table of contents
San Diego, California
SESSION: Process aware physical design
table of contents
Pages: 338 - 343
Year of Publication: 2007
ISBN ~ ISSN:0738-100X , 978-1-59593-627-1
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 41, Citation Count: 1
|
|
|
ABSTRACT
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes more difficult since the solution space expands greatly. We propose efficient dynamic programming approaches to handle the min-cost buffer insertion under process variations. Our approaches handle delay constraints and slew constraints, in trees and in combinational circuits. The experimental results demonstrate that in general, process variations have great impact on slew-constrained buffering, but much less impact on delay-constrained buffering, especially for small nets. Our approaches have less than 9% runtime overhead on average compared with a single pass of deterministic buffering for delay constrained buffering, and get 56% yield improvement and 11.8% buffer area reduction, on average, for slew constrained buffering.
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
|
Kanak Agarwal , Dennis Sylvester , David Blaauw , Frank Liu , Sani Nassif , Sarma Vrudhula, Variational delay metrics for interconnect timing analysis, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA
[doi> 10.1145/996566.996675]
|
 |
2
|
|
 |
3
|
|
| |
4
|
H. B. Bakoglu. Circuits, Interconnections, and Packaging for VLSI. Addison-Wesley, 1990.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
K. Chopra , S. Shah , A. Srivastava , D. Blaauw , D. Sylvester, Parametric yield maximization using gate sizing based on efficient statistical power and delay gradient computation, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.1023-1028, November 06-10, 2005, San Jose, CA
|
| |
10
|
|
| |
11
|
|
| |
12
|
M. R. Guthaus , N. Venkateswarant , C. Visweswariaht , V. Zolotov, Gate sizing using incremental parameterized statistical timing analysis, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.1029-1036, November 06-10, 2005, San Jose, CA
|
 |
13
|
Lei He , Andrew Kahng , King Ho Tam , Jinjun Xiong, Simultaneous buffer insertion and wire sizing considering systematic CMP variation and random leff variation, Proceedings of the 2005 international symposium on Physical design, April 03-06, 2005, San Francisco, California, USA
[doi> 10.1145/1055137.1055154]
|
 |
14
|
Shiyan Hu , Charles J. Alpert , Jiang Hu , Shrirang Karandikar , Zhuo Li , Weiping Shi , C. N. Sze, Fast algorithms for slew constrained minimum cost buffering, Proceedings of the 43rd annual conference on Design automation, July 24-28, 2006, San Francisco, CA, USA
[doi> 10.1145/1146909.1146990]
|
 |
15
|
|
 |
16
|
Chandramouli V. Kashyap , Charles J. Alpert , Frank Liu , Anirudh Devgan, Closed form expressions for extending step delay and slew metrics to ramp inputs, Proceedings of the 2003 international symposium on Physical design, April 06-09, 2003, Monterey, CA, USA
[doi> 10.1145/640000.640009]
|
| |
17
|
|
| |
18
|
|
| |
19
|
J. Lillis, C. K. Cheng, and T. T. Y. Lin. Optimal wire sizing and buffer insertion for low power and a generalized delay model. IEEE Journal of Solid-State Circuits, 31:437--447, 1996.
|
 |
20
|
|
 |
21
|
|
 |
22
|
Prashant Saxena , Noel Menezes , Pasquale Cocchini , Desmond A. Kirkpatrick, The scaling challenge: can correct-by-construction design help?, Proceedings of the 2003 international symposium on Physical design, April 06-09, 2003, Monterey, CA, USA
[doi> 10.1145/640000.640014]
|
| |
23
|
W. Shi and Z. Li. A fast algorithm for optimal buffer insertion. IEEE Transactions on Computer-Aided Design of Integrated Circuits, 24(6):879--891, 2005.
|
| |
24
|
|
| |
25
|
|
 |
26
|
C. N. Sze , Charles J. Alpert , Jiang Hu , Weiping Shi, Path based buffer insertion, Proceedings of the 42nd annual conference on Design automation, June 13-17, 2005, Anaheim, California, USA
[doi> 10.1145/1065579.1065711]
|
| |
27
|
L. P. P. P. van Ginneken. Buffer placement in distributed RC-tree networks for minimal Elmore delay. In ISCAS, pages 865--868, 1990.
|
 |
28
|
C. Visweswariah , K. Ravindran , K. Kalafala , S. G. Walker , S. Narayan, First-order incremental block-based statistical timing analysis, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA
[doi> 10.1145/996566.996663]
|
 |
29
|
|
 |
30
|
|
| |
31
|
|
 |
32
|
Hai Zhou , D. F. Wong , I-Min Liu , Adnan Aziz, Simultaneous routing and buffer insertion with restrictions on buffer locations, Proceedings of the 36th ACM/IEEE conference on Design automation, p.96-99, June 21-25, 1999, New Orleans, Louisiana, United States
[doi> 10.1145/309847.309885]
|
|