1. Statistical criticality computation using the circuit delay
- Author
-
Vinita Vasudevan and S. Ramprasath
- Subjects
Mathematical optimization ,Speedup ,Computer science ,Pruning algorithms ,Computation ,Measure (physics) ,Computer Graphics and Computer-Aided Design ,Criticality ,Path (graph theory) ,Pruning techniques ,Timing optimization ,Node (circuits) ,Pruning (decision trees) ,Electrical and Electronic Engineering ,Algorithm ,Electric network analysis ,Software - Abstract
The statistical nature of gate delays in current day technologies necessitates the use of measures, such as path criticality and node/edge criticality for timing optimization. Node criticalities are typically computed using the complementary path delay. An alternative approach to compute the criticality using the circuit delay has been recently proposed. In this paper, we discuss in detail, the use of circuit delay to compute node criticalities and show that the criticality thus found is not equal to the conventional measure found using complementary path delay. However, there is a monotonic relationship between them and the two measures can be used interchangeably. We derive new bounds for the global criticality and propose a pruning algorithm based on these bounds to improve the accuracy and speed of computation. The use of this pruning technique results in a significant speedup in criticality computations. We obtain an order of magnitude average speedup for ISCAS benchmarks.
- Published
- 2014
- Full Text
- View/download PDF