ACM Home Page
Please provide us with feedback. Feedback
Clock buffer and wire sizing using sequential programming
Full text PdfPdf (809 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 43rd annual Design Automation Conference table of contents
San Francisco, CA, USA
SESSION: Session 58: advanced methods for interconnect extraction, clocks and reliability table of contents
Pages: 1041 - 1046  
Year of Publication: 2006
ISBN:1-59593-381-6
Authors
Matthew R. Guthaus  University of Michigan, Ann Arbor, MI
Dennis Sylvester  University of Michigan, Ann Arbor, MI
Richard B. Brown  University of Utah, Salt Lake City, UT
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 46,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1146909.1147171
What is a DOI?

ABSTRACT

This paper investigates methods for clock skew minimization using buffer and wire sizing. First, a technique that significantly improves solution quality and stability of sequential programming-based buffer/wire sizing is used. Then, a new formulation of clock skew minimization that uses quadratic programming and considers sub-critical skews in addition to the most critical skews is presented. The quality of results are verified to be more robust using Monte Carlo simulations to account for process sensitivity. For the same power budget, the sequential quadratic programming (SQP) method has better expected skew, standard deviation, and overall CPU time on average.


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
C. Albrecht, A. B. Kahng, B. Liu, I. Mandoiu, and A. Zelikovsky. On the skew-bounded minimum buffer routing tree problem. In SASIMI, pages 250--256, 2001.
3
 
4
K. Boese and A. Kahng. Zero-skew clock routing trees with minimum wirelength. In ASIC Conf., pages 1.1.1--1.1.5, 1992.
 
5
Y. Cao, P. Gupta, A. B. Kahng, D. Sylvester, and J. Yang. Design sensitivities to variability: Extrapolations and assessments in nanometer VLSI. In ASIC/SOC, pages 411--415, September 2002.
 
6
7
 
8
Computational infrastructure for operations research. http://www.coin-or.org.
 
9
 
10
 
11
International technology roadmap on semiconductors. http://public.itrs.net, 2004.
 
12
R. Kay and L. T. Pileggi. EWA: Efficient wiring-sizing algorithm for signal nets and clock nets. IEEE Trans. on CAD, 17(1):40--49, January 1998.
 
13
I. S. Kourtev and E. G. Friedman. A quadratic programming approach to clock skew scheduling for reduced sensitivity to process parameter variations. In ASIC/SOC, pages 210--215, 1999.
14
15
16
 
17
J. Nocedal and S. J. Wright. Numerical Optimization. Springer, 1999.
18
 
19
G. E. Tellez and M. Sarrafzadeh. Minimal buffer insertion in clock trees with skew and slew rate constraints. IEEE Trans. on CAD, 16(4):333--342, 1997.
 
20
J.-L. Tsai, T.-H. Chen, and C. C. Chen. Zero skew clock-tree optimization with buffer insertion/sizing and wire sizing. IEEE Trans. on CAD, 23(4):565--573, April 2004.
21


Collaborative Colleagues:
Matthew R. Guthaus: colleagues
Dennis Sylvester: colleagues
Richard B. Brown: colleagues