z-logo
open-access-imgOpen Access
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer chips
Author(s) -
Michael Orshansky,
WeiShen Wang,
Martine Ceberio,
Gang Xiang
Publication year - 2006
Publication title -
scholarworks - utep (the university of texas at el paso)
Language(s) - English
Resource type - Conference proceedings
ISBN - 1-59593-108-2
DOI - 10.1145/1141277.1141664
Subject(s) - monte carlo method , interval (graph theory) , computer science , probability distribution , algorithm , regular polygon , mathematical optimization , mathematics , statistics , geometry , combinatorics
In chip design, one of the main objectives is to decrease its clock cycle. On the design stage, this time is usually estimated by using worst-case (interval) techniques, in which we only use the bounds on the parameters that lead to delays. This analysis does not take into account that the probability of the worst-case values is usually very small; thus, the resulting estimates are over-conservative, leading to unnecessary over-design and under-performance of circuits. If we knew the exact probability distributions of the corresponding parameters, then we could use Monte-Carlo simulations (or the corresponding analytical techniques) to get the desired estimates. In practice, however, we only have partial information about the corresponding distributions, and we want to produce estimates that are valid for all distributions which are consistent with this information.In this paper, we develop a general technique that allows us, in particular, to provide such estimates for the clock time.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom