Non-enumerative Generation of Path Delay Distributions and its Application to Critical Path Selection

Authors

Ahish Mysore Somashekhar, Southern Illinois University CarbondaleFollow
Spyros Tragoudas, Southern Illinois University CarbondaleFollow
Rathish Jayabharathi, IntelFollow
Sreenivas Gangadhar, IntelFollow

Comments

© 2016 ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record will be published in ACM Transactions on Design Automation of Electronic Systems.

Abstract

A Monte Carlo based approach is proposed capable of identifying in a non-enumerative and scalable manner the distributions that describe the delay of every path in a combinational circuit. Furthermore, a scalable approach to select critical paths from a potentially exponential number of path candidates is presented. Paths and their delay distributions are stored in Zero Suppressed Binary Decision Diagrams. Experimental results on some of the largest ISCAS-89 and ITC-99 benchmarks shows that the proposed method is highly scalable and effective.

Recommended Citation

Somashekhar, Ahish Mysore, Tragoudas, Spyros, Jayabharathi, Rathish and Gangadhar, Sreenivas. "Non-enumerative Generation of Path Delay Distributions and its Application to Critical Path Selection." ACM Transactions on Design Automation of Electronic Systems (Jan 2016).