ACM Home Page
Please provide us with feedback. Feedback
Efficient statistical timing analysis through error budgeting
Full text PdfPdf (777 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design table of contents
Pages: 473 - 477  
Year of Publication: 2004
ISBN:0-7803-8702-3
Authors
V. Khandelwal  Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA
A. Davoodi  Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA
A. Srivastava  Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 11,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/ICCAD.2004.1382623

ABSTRACT

We propose a technique for optimizing the runtime in statistical timing analysis. Given a global acceptable error budget at the primary output which signifies the difference in the area of the accurate and approximate timing CDFs, we propose a formulation of budgeting this global error across all nodes in the circuit. This node error budget is used to simplify the computation of arrival time CDFs at each node using approximations. This simplification reduces the runtime of statistical timing analysis. We investigate two ways of exploiting this node error budget, firstly through piecewise linear approximation (see ibid., A. Devgan and C. Kashyap, 2003) and secondly though hierarchical quadratic approximation. Experimental results on ISCAS/MCNC benchmarks show that our approach is at most 3 times faster than accurate statistical timing analysis and had a very small error. We also found quadratic piecewise approximation to be more accurate than linear approximation but at lesser gains in runtime.


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
 
3
[3] A. Agarwal, V. Zolotov and D. Blaauw. "Statistical Timing Analysis Using Bounds and Selective Enumeration". In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 22, Sept. 2003.
 
4
5
 
6
[6] C. Visweswariah et al. "First-Order Parameterized Block-Based Statistical Timing Analysis". In Procs of TAU, 2004.
 
7
[7] E.M. Sentovich, K.J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P.R. Stephan, R.K. Brayton, A.L. Sangiovanni-Vincentelli. SIS: A System for Sequential Circuit Synthesis, Memorandum No. UCB/ERL M92/41, Department of EECS. UC Berkeley, May 1992.
 
8
 
9
[9] H. J. Bungartz. "Higher Order Finite Elements on Sparse Grids". In Technical Report SFB-Bericht Nr. 342/01/95 A, Institut fur Informatik, TU Munich 1995.
 
10
[10] H. J. Bungartz and T. Dornseifer. "Sparse Grids: Recent Developments for Elliptic Partial Differential Equations". In Technical Report TUM-19702, SFB-Bericht Nr. 342/02/97 A, Institut fur Informatik, TU Munich 1997.
11
 
12
 
13

Collaborative Colleagues:
V. Khandelwal: colleagues
A. Davoodi: colleagues
A. Srivastava: colleagues