| Discrete buffer and wire sizing for link-based non-tree clock networks |
| Full text |
Pdf
(229 KB)
|
Source
|
International Symposium on Physical Design
archive
Proceedings of the 2008 international symposium on Physical design
table of contents
Portland, Oregon, USA
SESSION: Electrical issues and clock network design in physical synthesis
table of contents
Pages 175-181
Year of Publication: 2008
ISBN:978-1-60558-048-7
|
|
Authors
|
|
Rupak Samanta
|
Texas A&M University, College Station, TX, USA
|
|
Jiang Hu
|
Texas A&M University, College Station, TX, USA
|
|
Peng Li
|
Texas A&M University, College Station, TX, USA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 11, Downloads (12 Months): 32, Citation Count: 0
|
|
|
ABSTRACT
Clock network is a vulnerable victim of variations as well as a main power consumer in many integrated circuits. Recently, link-based non-tree clock network attracts people's attention due to its appealing tradeoff between variation tolerance and power overhead. In this work, we investigate how to optimize such clock networks through buffer and wire sizing. A two-stage hybrid optimization approach is proposed. It considers the realistic constraint of discrete buffer/wire sizes and is based on accurate delay models. In order to provide reliable and efficient guidance for the optimization, we suggest to apply SVM (Support Vector Machine) based machine learning as a surrogate for expensive circuit-level simulation. Experimental results on benchmark circuits show that our sizing method can reduce clock skew by 43% on average with very small increase on power dissipation
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
|
P. J. Restle, T. G. McNamara, D. A. Webber, P. J. Camporese, K. F. Eng, K. A. Jenkins, D. H. Allen, M. J. Rohn, M. P. Quaranta, D. W. Boerstler, C. J. Alpert, C. A. Carter, R. N. Bailey, J. G. Petrovick, B. L. Krauter, and B. D. McCredie. A clock distribution network for microprocessors. IEEE Journal of Solid-State Circuits, 36(5):792--799, May 2001.
|
 |
2
|
|
 |
3
|
|
| |
4
|
W.-C. D. Lam , J. Jam , C.-K. Koh , V. Balakrishnan , Y. Chen, Statistical based link insertion for robust clock network design, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.588-591, November 06-10, 2005, San Jose, CA
|
| |
5
|
|
| |
6
|
G. Venkataraman , N. Jayakumar , J. Hu , P. Li , Sunil Khatri , Anand Rajaram , P. McGuinness , C. Alpert, Practical techniques to reduce skew and its variations in buffered clock networks, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.592-596, November 06-10, 2005, San Jose, CA
|
 |
7
|
|
| |
8
|
S. Pullela, N. Menezes, J. Omar, and L. T. Pillage. Skew and delay optimization for reliable buffered clock trees. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pages 556--562, 1993.
|
| |
9
|
S. Pullela, N. Menezes, and L. T. Pileggi. Moment-sensitivity-based wire sizing for skew reduction in on-chip clock nets. IEEE Transactions on Computer-Aided Design, 16(2):210--215, February 1997.
|
 |
10
|
|
| |
11
|
|
 |
12
|
I-Min Liu , Tan-Li Chou , Adnan Aziz , D. F. Wong, Zero-skew clock tree construction by simultaneous routing, wire sizing and buffer insertion, Proceedings of the 2000 international symposium on Physical design, p.33-38, May 2000, San Diego, California, United States
[doi> 10.1145/332357.332370]
|
| |
13
|
K. Wang, Y. Ran, H. Jiang, and M. Marek-Sadowska. General skew constrained clock network sizing based on sequential linear programming. IEEE Transactions on Computer-Aided Design, 24(5):773--782, May 2005.
|
 |
14
|
|
| |
15
|
|
| |
16
|
|
| |
17
|
V. N. Vapnik. Statistical Learning Theory. Wiley-Interscience Publishers, New York, NY, 1998.
|
| |
18
|
|
| |
19
|
B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291--307, February 1970.
|
| |
20
|
CPMO-constrained placement by multilevel optimization. http://ballade.cs.ucla.edu/cpmo/. Computer Science Department, UCLA.
|
| |
21
|
E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. SIS: a system for sequential circuit synthesis. Memorandum no. M92/41, ERL, University of California, Berkeley, May 1992.
|
| |
22
|
Y. Cao, T. Sato, D. Sylvester, M. Orshansky and C. Hu. New paradigm of predictive MOSFET and interconnect modeling for early circuit simulation. IEEE Custom Integrated Circuit Conference, pages 201--204, 2000.
|
|