Article

Free access

Critical path selection for performance optimization

Authors:

Hsi-Chuan Chen,

David H. C. Du,

Li-Ren LiuAuthors Info & Claims

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

Pages 547 - 550

https://doi.org/10.1145/127601.127730

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

J. BENKOSKI AND ET AL, Timing Verification Using Statically Sensitizable paths, IEEE TCAD, cad-9 (1990), pp. 1073-1084.

Google Scholar

[2]

It. CHEN AND D. Du, Path Sensitization in Critical Path Problem, in ACM International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 1990.

Google Scholar

[3]

H. CHEN, D. Du, AND L. Lru, Critical Path Selection for Performance Optimization, Tech. Report TR90- 60, Computer Science Department, University of Minnesota, 1990.

Google Scholar

[4]

G. DEMICHELI, Performance-Oriented Synthesis in the Yorktown Silicon Compiler, in IEEE ICCAD, 1986, pp. 138-141.

Google Scholar

[5]

D. DU, H. YEN, AND S. GHANTA, On the General False Path Problem in Timing Analgsis, in 26th DAC, 1989, pp. 560-566.

Digital Library

Google Scholar

[6]

P. MCGEER AND R. BRAYTON, Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network, in 26th DAC, 1989, pp. 561-567.

Digital Library

Google Scholar

[7]

S. PERR~MANS, L. CLAESEN, AND H. DEMAN, Static Timing Analysis of Dynamically Sensitizable Paths, in 26th DAC, 1989, pp. 568-573.

Digital Library

Google Scholar

Cited By

View all

Cheung EHsieh HBalarin FGebotys CMartin G(2008)Software optimization for MPSoCProceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis10.1145/1450135.1450146(43-48)Online publication date: 19-Oct-2008
https://dl.acm.org/doi/10.1145/1450135.1450146
Lin HHwang T(2006)On determining sensitization criterion in an iterative gate sizing processIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.74374218:2(231-238)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.743742
Fang CJone W(2006)Timing optimization by gate resizing and critical path identificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.37042414:2(201-217)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.370424
Show More Cited By

Index Terms

Critical path selection for performance optimization
1. Hardware
  1. Electronic design automation
    1. Logic synthesis
      1. Circuit optimization
  2. Integrated circuits
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Critical path selection for performance optimization

The problem of selecting a set of paths to optimize the performance of a combinational circuit is studied, assuming that gate resizing and buffer insertion are the two possible optimizing techniques for reducing the delay of a circuit. The objective of ...
Using selection to improve quantum-behaved particle swarm optimisation

Quantum-behaved particle swarm optimisation (QPSO) algorithm is a global convergence guaranteed algorithms, which outperforms original PSO in search ability but has fewer parameters to control. This paper describes two selection mechanisms into QPSO to ...
A distributed approach for multi-constrained path selection and routing optimization
QShine '06: Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks

Multi-constrained path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-constrained path optimization (MCPO) is different ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

June 1991

783 pages

ISBN:0897913957

DOI:10.1145/127601

Chairman:
A. Richard Newton
Univ. of California, Berkeley

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC91

Sponsor:

SIGDA
IEEE-CS

DAC91: The 28th ACM/IEEE Design Automation Conference

June 17 - 22, 1991

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)15

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cheung EHsieh HBalarin FGebotys CMartin G(2008)Software optimization for MPSoCProceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis10.1145/1450135.1450146(43-48)Online publication date: 19-Oct-2008
https://dl.acm.org/doi/10.1145/1450135.1450146
Lin HHwang T(2006)On determining sensitization criterion in an iterative gate sizing processIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.74374218:2(231-238)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.743742
Fang CJone W(2006)Timing optimization by gate resizing and critical path identificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.37042414:2(201-217)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.370424
Saldanha ABrayton RSangiovanni-Vincentelli A(2006)Circuit structure relations to redundancy and delayIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.29394413:7(875-883)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.293944
Cheng SChen HDu DLim A(2006)The role of long and short paths in circuit performance optimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.29394213:7(857-864)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.293942
Cremoux SAzemard NAuvergne D(1998)Path resizing based on incremental techniqueISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187)10.1109/ISCAS.1998.705219(90-93)Online publication date: 1998
https://doi.org/10.1109/ISCAS.1998.705219
Yaun-Chung Hsu Hsi-Chuan Chen Shangzhi Sun Du D(1998)Timing analysis of combinational circuits containing complex gatesProceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273)10.1109/ICCD.1998.727082(407-412)Online publication date: 1998
https://doi.org/10.1109/ICCD.1998.727082
Cremoux SAzemard NAuvergne D(1998)Path Selection Based on Incremental TechniqueMixed Design of Integrated Circuits and Systems10.1007/978-1-4615-5651-0_21(137-142)Online publication date: 1998
https://doi.org/10.1007/978-1-4615-5651-0_21
Lin HHwang TJess JRudell R(1994)Dynamical identification of critical paths for iterative gate sizingProceedings of the 1994 IEEE/ACM international conference on Computer-aided design10.5555/191326.191520(481-484)Online publication date: 6-Nov-1994
https://dl.acm.org/doi/10.5555/191326.191520
Hoon Chang Abraham J(1994)POP: an efficient Performance OPtimization algorithm based on integrated approachProceedings of IEEE Custom Integrated Circuits Conference - CICC '9410.1109/CICC.1994.379724(253-256)Online publication date: 1994
https://doi.org/10.1109/CICC.1994.379724
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Critical path selection for performance optimization

Using selection to improve quantum-behaved particle swarm optimisation

A distributed approach for multi-constrained path selection and routing optimization