ACM Home Page
Please provide us with feedback. Feedback
Probabilistic interval-valued computation: toward a practical surrogate for statistics inside CAD tools
Full text PdfPdf (957 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 10: statistical timing analysis table of contents
Pages: 167 - 172  
Year of Publication: 2006
ISBN:1-59593-381-6
Authors
Amith Singhee  Carnegie Mellon University, Pittsburgh, PA
Claire F. Fang  Carnegie Mellon University, Pittsburgh, PA
James D. Ma  Carnegie Mellon University, Pittsburgh, PA
Rob A. Rutenbar  Carnegie Mellon University, Pittsburgh, PA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 30,   Citation Count: 2
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.1146955
What is a DOI?

ABSTRACT

Interval methods offer a general, fine-grain strategy for modeling correlated range uncertainties in numerical algorithms. We present a new, improved interval algebra that extends the classical affine form to a more rigorous statistical foundation. Range uncertainties now take the form of confidence intervals. In place of pessimistic interval bounds, we minimize the probability of numerical "escape"; this can tighten interval bounds by 10X, while yielding 10-100X speedups over Monte Carlo. The formulation relies on three critical ideas: liberating the affine model from the assumption of symmetric intervals; a unifying optimization formulation; and a concrete probabilistic model. We refer to these as probabilistic intervals, for brevity. Our goal is to understand where we might use these as a surrogate for expensive, explicit statistical computations. Results from sparse matrices and graph delay algorithms demonstrate the utility of the approach, and the remaining challenges.


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
 
4
 
5
R.E. Moore, Interval Analysis, Prentice-Hall, 1966.
 
6
L. H. de Figueiredo and J. Stolfi, "Self-validated numerical methods and applications", Brazilian Mathematics Colloqium monograph, IMPA, Rio de Janeiro, July 1997.
 
7
C.L. Harkness, et al, "Interval Methods for Modeling Uncertainty in RC Timing Analysis," Proc. ACM/IEEE ICCAD, Nov. 1992.
8
9
 
10
11
 
12
 
13
W. Feller, "An Introduction to Probability Theory and Its Applications", Vol. 2, 3rd ed., Wiley, New York, 1971
 
14
G. Marsaglia, "Ratio of Normal Variables and Ratios of Sums of Uniform Variables", J. of Amer. Stat. Assn., 60(309), Mar 1965
 
15
A. Singhee, et al, "Probabilistic Interval-Valued Computation: Toward a Practical Surrogate for Statistics Inside CAD Tools," CMU CSSI Technical Report manuscript, in progress.
16


Collaborative Colleagues:
Amith Singhee: colleagues
Claire F. Fang: colleagues
James D. Ma: colleagues
Rob A. Rutenbar: colleagues