A Probabilistic Approach to Buffer Insertion

Authors:
Vishal Khandelwal;Azadeh Davoodi;Akash Nanavati;Ankur Srivastava
Affiliations:
University of Maryland at College Park;University of Maryland at College Park;University of California at Los Angeles;University of Maryland at College Park
Venue:
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Year:
2003

Citing 10
Cited 13

A buffer distribution algorithm for high-speed clock routing

DAC '93 Proceedings of the 30th international Design Automation Conference
Clock period constrained minimal buffer insertion in clock trees

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
The approximability of NP-hard problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Simultaneous buffer insertion and non-Hanan optimization for VLSI interconnect under a higher order AWE model

ISPD '99 Proceedings of the 1999 international symposium on Physical design
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Predictability: definition, ananlysis and optimization

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Parameter variations and impact on circuits and microarchitecture

Proceedings of the 40th annual Design Automation Conference
Death, taxes and failing chips

Proceedings of the 40th annual Design Automation Conference
Computation and Refinement of Statistical Bounds on Circuit Delay

Proceedings of the 40th annual Design Automation Conference
Voltage scheduling under unpredictabilities: a risk management paradigm

Proceedings of the 2003 international symposium on Low power electronics and design

Empirical models for net-length probability distribution and applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Buffer Insertion Considering Process Variation

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Simultaneous buffer insertion and wire sizing considering systematic CMP variation and random leff variation

Proceedings of the 2005 international symposium on Physical design
Variability-Driven Buffer Insertion Considering Correlations

ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Wire-length prediction using statistical techniques

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Probabilistic evaluation of solutions in variability-driven optimization

Proceedings of the 2006 international symposium on Physical design
Fast buffer insertion considering process variations

Proceedings of the 2006 international symposium on Physical design
Buffer insertion under process variations for delay minimization

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Efficient algorithms for buffer insertion in general circuits based on network flow

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Stochastic physical synthesis for FPGAs with pre-routing interconnect uncertainty and process variation

Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
Fast min-cost buffer insertion under process variations

Proceedings of the 44th annual Design Automation Conference
Synergistic physical synthesis for manufacturability and variability in 45nm designs and beyond

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Stochastic physical synthesis considering prerouting interconnect uncertainty and process variation for FPGAs

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a formal probabilistic approach for solving optimizationproblems in design automation. Prediction accuracy isvery low especially at high levels of design flow. This can be attributedmainly to unawareness of low level layout information andvariability in fabrication process. Hence a traditional deterministicdesign automation approach where each cost function is representedas a fixed value becomes obsolete. A new approach is gainingattention in which the cost functions are representedas probability distributions and the optimization criteriais probabilistic too. This design optimization philosophy is demonstratedthrough the classic buffer insertion problem. Formally,we capture wirelengths as probability distributions (as compared tothe traditional approach which considers wirelength as fixed values)and present several strategies for optimizing the probabilisticcriteria. During the course of this work many problems are provedto be NP-Complete. Comparisons are made with the Van-Ginneken"optimal under fixed wire-length" algorithm. Results show that theVan-Ginneken approach generated delay distributions at the root ofthe fanout wiring tree which had large probability (0.91 in the worstcase and 0.55 on average) of violating the delay constraint. Ouralgorithms could achieve 100% probability of satisfying the delayconstraint with similar buffer penalty. Although this work considerswirelength prediction inaccuracies, our probabilistic strategy couldbe extended trivially to consider fabrication variability in wire parasitics.