Efficient algorithms for extracting the K most critical paths in timing analysis

  • Authors:
  • S. H. Yen;D. H. Du;S. Ghanta

  • Affiliations:
  • Department of Computer Science, University of Minnesota, Minneapolis, MN;Department of Computer Science, University of Minnesota, Minneapolis, MN;Department of Computer Science, University of Minnesota, Minneapolis, MN

  • Venue:
  • DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

Path extracting algorithms are a very important part of timing analysis approach. In this paper we designed and developed several algorithms which can generate the K most critical paths in a non-increasing order of their delays. The effectiveness of these algorithms is shown by some experimental results.