An exact algorithm for the statistical shortest path problem

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 2006, Issue , 2006, Pages 965-970

  Deng, Liang ^a   Wong, Martin D F ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; GRAPH THEORY; NANOTECHNOLOGY; PARAMETER ESTIMATION; STATISTICAL METHODS;

GRAPH ALGORITHMS; PARAMETER VARIATIONS; STATISTICAL SHORTEST PATH (SSP); TIMING ANALYSIS;

VLSI CIRCUITS;

EID: 33748618417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1118299.1118515     Document Type: Conference Paper

References (15)

1. Shekhar Borkar, Tanay Karnik, Siva Narendra, Jim Tschanz, Ali Keshavarzi, and Vivek De. Parameter variations and impact on circuits and microarchitecture. In Proc. of the 40th Design Automation Conference, pages 338-342. ACM Press, 2003.
2. H. Frank. Shortest path in probabilistic graphs. Oper. Res., 17:583-599, 1969.
3. C. Elliott Sigal, A. Alan B. Pritsker, and James J. Solberg. The stochastic shortest route problem. Opers. Res., 28:1122-1128, 1980.
4. R. P. Loui. Optimal path in graphs with stochastic or multidimensional weights. Comm. of ACM, 26:670-676, 1983.
5. Ishwar Murthy. Stochastic shortest path problems with piecewise-linear concave utility functions. Management Science, 44:125-136, 11 1998.
6. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, 2001.
7. Duane Boning and Sani Nassif. Design of High-Performance Microprocessor Circuits. 2002.
8. Kanak Agarwal, Dennis Sylvester, David Blaauw, Frank Liu, Sani Nassif, and Sarma Vrudhula. Variational delay metrics for interconnect timing analysis. In DAC 2004, pages 381-384. ACM Press, 2004.
9. Semiconductor Industry Association. International Technology Roadmap for Semiconductors, 2001.
10. Michael Orshansky and Kurt Keutzer. A general probabilistic framework for worst case timing analysis. In Proc. of the 39th Design Automation Conference, pages 556-561. ACM Press, 2002.
11. Hongliang Chang and S.S. Sapatnekar. Statistical timing analysis considering spatial correlations using a single pert-like traversal. In Proc. International Conference on Computer Aided Design, pages 621-625, 2003.
12. A. Davgan and C. Kashyap. Block-based static timing analysis with uncertainty. In Proc. of international conference on Computer Aided Design 2003, pages 607-614, 2003.
13. C. Visweswariah, K. Ravindran, K. Kalafala, S. G. Walker, and S. Narayan. First-order incremental block-based statistical timing analysis. In Proc. of the 41st Design Automation Conference, pages 331-336, New York, NY, USA, 2004. ACM Press.
14. Chirayu S. Amin, Noel Menezes, Kip Killpack, Florentin Dartu, Yehea Ismail, Umakanta Choudhury, and Nagib Hakim. Statistical static timing analysis: How simple can we get? In Proc. of the 42nd Design Automation Conference, pages 652-657, New York, NY, USA, 2005. ACM Press.
15. Y. Gao and D. Wong. A graph based algorithm for optimal buffer insertion under accurate delay models. In Proc. of the conference on Design, automation and test in Europe, pages 535-539. IEEE Press, 2001.