ACM Home Page
Please provide us with feedback. Feedback
Optimal useful clock skew scheduling in the presence of variations using robust ILP formulations
Full text PdfPdf (203 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California
SESSION: Post-placement optimization techniques table of contents
Pages: 27 - 32  
Year of Publication: 2006
ISBN ~ ISSN:1092-3152 , 1-59593-389-1
Authors
Vaibhav Nawale  Intel Corporation, Santa Clara
Thomas W. Chen  Colorado State University, Ft. Collins, CO
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 55,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

This paper exploits useful skew to improve system performance and robustness. We formulate a robust integer linear programming problem considering the interactions between data and clock paths on a microprocessor chip to improve clock frequency. The timing slack is optimized for each path to determine a clock schedule. The percentage of timing violations, obtained from a 1000 point Monte Carlo simulation, is higlighted as yield predictions and conveys the robustness of the clock schedule. The results show performance improvement of up to 9.747% with 20% yield and up to 6.682% with 100% yield. The novelty of the proposed method is its ability to tradeoff between performance improvement in frequency and robustness, via a single variable in the formulation.


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
M. Bertsimas, D. Sim. Robust Discrete Optimization and Network Flows. Oper. Res. Center, MIT, Jan.
 
2
L.-F. Chao and H.-M. Sha. Retiming and clock skew for synchronous systems. ISCAS; pp 283--286, May 1994.
 
3
R. Deokar and S. Sapatnekar. A graph-theoretic approach to clock skew optimization. ISCAS; pp 407--410, 30 May - 2 June 1994.
 
4
 
5
6
 
7
P. Mahoney, E. Fetzer, B. Doyle, and S. Naffziger. Clock Distribution on a Dual-Core Multi-Threaded Itanium- Family Processor. ISSCC Session 16, 2005.
 
8
S. Malik, E. Sentovich, R. Brayton, and A. Sangiovanni-Vincentelli. Retiming and resynthesis: optimizing sequential networks with combinational techniques. 1990., Proc. 23rd Annual Hawaii Int. Conf.; pp 397--406, 2--5 Jan 1990 1997.
 
9
V. Mehrotra and D. Boning. Technology scaling impact of variation on clock skew and interconnect delay. Interconnect Tech. Conf., Proc. of IEEE, 4--6 June 2001.
10
 
11
 
12
K. e. a. Sakallah. Analysis and design of latch-controlled synchronous digital circuits. DAC; pp 322--333, March 1992.
 
13
R. Saleh, S. Z. Hussain, S. Rochel, and D. Overhauser. Clock skew in the presence of IR-drop in the power distribution network. IEEE Tran. on CAD of ISCAS, Jun 2000.
 
14
A. L. Soyster. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res.; pp 1154--1157, 1973.
 
15
Y. Taur and D. Buchanan. CMOS scaling in nanometer regime. Proc. IEEE; pp 486--503, Apr 1997.


Collaborative Colleagues:
Vaibhav Nawale: colleagues
Thomas W. Chen: colleagues