| Efficient Monte Carlo based incremental statistical timing analysis |
| Full text |
Pdf
(1.15 MB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 45th annual Design Automation Conference
table of contents
Anaheim, California
SESSION: Statistical timing analysis
table of contents
Pages 676-681
Year of Publication: 2008
ISBN ~ ISSN:0738-100X , 978-1-60558-115-6
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 19, Downloads (12 Months): 104, Citation Count: 0
|
|
|
ABSTRACT
Modeling and accuracy difficulties exist with traditional SSTA analysis and optimization methods. In this paper we describe methods to improve the efficiency of Monte Carlo-based statistical static timing analysis. We propose a Stratification + Hybrid Quasi Monte Carlo (SH-QMC) approach to reduce the number of samples required for Monte Carlo based SSTA. Our simulations on benchmark circuits up to 90K gates show that the proposed method requires 23.8X fewer samples on average to achieve comparable accuracy in timing estimation as a random sampling approach. Results on benchmark circuits also show that when SH-QMC is performed with multiple parallel threads on a quad core processor, the approach is faster than traditional SSTA with comparable accuracy. SH-QMC scales better than traditional SSTA with circuit size. We also propose an incremental approach to recompute a percentile delay metric after ECO. The results show that on average only 1.4% and 0.7% of original samples need to be evaluated for exact recomputation of the 95th percentile and 99th percentile delays, after sample size reduction using SH-QMC.
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
|
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]
|
| |
2
|
|
| |
3
|
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
|
 |
4
|
|
| |
5
|
L. Scheffer, "The Count of Monte Carlo," TAU, 2004.
|
| |
6
|
M. Keramat and R. Kielbasa, "Worst Case Efficiency of LHSMC Yield Estimator of Electrical Circuits." Proc. ISCAS, v. 3, pp. 1660--1663, 1997.
|
 |
7
|
|
| |
8
|
S. Tasiran and A. Demir, "Smart Monte Carlo for Yield Estimation," TAU, 2006.
|
| |
9
|
|
| |
10
|
E. Hlawka, "Funktionen von beschrankter Variation in der Theorie der Gleich-verteilung", Ann. Mat. Pura Appl., 54, pp 325--333., 1961.
|
| |
11
|
|
| |
12
|
I. M. Sobol, "The Distribution of Points in a Cube and the Approximate Evaluation of Integrals", USSR Comp. Math and Math. Phys., 7(4), pp. 86--112, 1967.
|
 |
13
|
|
| |
14
|
|
| |
15
|
F. Brglez and H. Fujiwara, "Neutral netlist of ten combinational benchmark circuits and a target translator in FORTRAN", Special session on ATPG and fault simulations, Proc. ISCAS, pp. 695--698, 1985.
|
|