Critical path selection for performance optimization

Hsi Chuan Chen, David H.C. Du, Li Ren Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

The problem of selecting a set of paths to optimize the performance of a circuit is studied. The authors assume that gate resizing is the optimizing technique used to reduce the delay of a circuit. That is, during the optimization process the topology of a circuit remains the same and the gate delays are reduced. The objective of the path selection problem is to select as few paths as possible so that when the delays of all selected paths are shortened, the delay of the optimized circuit is guaranteed to meet its performance requirement. The authors first propose an input-vector-oriented path selection algorithm. Due to the fact that the input-vector-oriented algorithm may be not feasible for complex designs with many input pins, they have designed and developed a path-oriented algorithm. For some ISCAS circuits, less than 10% of the long paths are selected by this path-oriented algorithm.

Original languageEnglish (US)
Title of host publicationProceedings - Design Automation Conference
PublisherPubl by IEEE
Pages547-550
Number of pages4
ISBN (Print)0818691492, 9780818691492
DOIs
StatePublished - 1991
EventProceedings of the 28th ACM/IEEE Design Automation Conference - San Francisco, CA, USA
Duration: Jun 17 1991Jun 21 1991

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0146-7123

Other

OtherProceedings of the 28th ACM/IEEE Design Automation Conference
CitySan Francisco, CA, USA
Period6/17/916/21/91

Fingerprint Dive into the research topics of 'Critical path selection for performance optimization'. Together they form a unique fingerprint.

Cite this