Article

Provably correct critical paths

Authors:

Patrick C. McGeer,

Robert K. BraytonAuthors Info & Claims

Proceedings of the decennial Caltech conference on VLSI on Advanced research in VLSI

Pages 119 - 142

Published: 01 June 1989 Publication History

Abstract

No abstract available.

Cited By

View all

Kishinevsky MKondratyev ALavagno LSaldanha ATaubin AOtten RYasuura H(1997)Partial scan delay fault testing of asynchronous circuitsProceedings of the 1997 IEEE/ACM international conference on Computer-aided design10.5555/266388.266622(728-735)Online publication date: 13-Nov-1997
https://dl.acm.org/doi/10.5555/266388.266622
Lam WBrayton RSangiovanni-Vincentelli ALorenzetti M(1994)Exact minimum cycle times for finite state machinesProceedings of the 31st annual Design Automation Conference10.1145/196244.196294(100-105)Online publication date: 6-Jun-1994
https://dl.acm.org/doi/10.1145/196244.196294
Lam WSaldanha ABrayton RSangiovanni-Vincentelli ADunlop A(1993)Delay fault coverage and performance tradeoffsProceedings of the 30th international Design Automation Conference10.1145/157485.164970(446-452)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164970
Show More Cited By

Index Terms

Provably correct critical paths

Recommendations

Determining the K Most Critical Paths in PERT Networks

A fundamental problem in PERT networks is to identify a project's critical paths and its critical activities. In this paper we define the criticality index of a path as the probability that the duration of the path is greater than or equal to the ...
Fractional routing using pairs of failure-disjoint paths

Given a set of commodities and a network where some arcs can fail while others are reliable, we consider a routing problem with respect to a survivability requirement that each commodity can be split among pairs of failure-disjoint paths. Two paths p ...
Improved algorithms for the k simple shortest paths and the replacement paths problems

Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Proceedings of the decennial Caltech conference on VLSI on Advanced research in VLSI

June 1989

377 pages

ISBN:0262192829

Editor:
Charles L. Seitz

Publisher

MIT Press

Cambridge, MA, United States

Publication History

Published: 01 June 1989

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kishinevsky MKondratyev ALavagno LSaldanha ATaubin AOtten RYasuura H(1997)Partial scan delay fault testing of asynchronous circuitsProceedings of the 1997 IEEE/ACM international conference on Computer-aided design10.5555/266388.266622(728-735)Online publication date: 13-Nov-1997
https://dl.acm.org/doi/10.5555/266388.266622
Lam WBrayton RSangiovanni-Vincentelli ALorenzetti M(1994)Exact minimum cycle times for finite state machinesProceedings of the 31st annual Design Automation Conference10.1145/196244.196294(100-105)Online publication date: 6-Jun-1994
https://dl.acm.org/doi/10.1145/196244.196294
Lam WSaldanha ABrayton RSangiovanni-Vincentelli ADunlop A(1993)Delay fault coverage and performance tradeoffsProceedings of the 30th international Design Automation Conference10.1145/157485.164970(446-452)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164970
Lam WBrayton RSangiovanni-Vincentelli ADunlop A(1993)Circuit delay models and their exact computation using Timed Boolean FunctionsProceedings of the 30th international Design Automation Conference10.1145/157485.164625(128-134)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.164625
Lam WBrayton RSangiovanni-Vincentelli ATrevillyan LLightner M(1992)Valid clocking in wavepipelined circuitsProceedings of the 1992 IEEE/ACM international conference on Computer-aided design10.5555/304032.304162(518-525)Online publication date: 8-Nov-1992
https://dl.acm.org/doi/10.5555/304032.304162
Saldanha ABrayton RSangiovanni-Vincentelli ASchweikert D(1992)Circuit structure relations to redundancy and delayProceedings of the 29th ACM/IEEE Design Automation Conference10.5555/113938.149425(245-248)Online publication date: 1-Jul-1992
https://dl.acm.org/doi/10.5555/113938.149425
Keutzer KMalik SSaldanha ASmith R(1991)Is redundancy necessary to reduce delayProceedings of the 27th ACM/IEEE Design Automation Conference10.1145/123186.128295(228-234)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/123186.128295
McGeer PBrayton RSmith R(1991)Timing analysis in precharge/unate networksProceedings of the 27th ACM/IEEE Design Automation Conference10.1145/123186.123239(124-129)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/123186.123239
McGeer PBrayton RThomas D(1989)Efficient algorithms for computing the longest viable path in a combinational networkProceedings of the 26th ACM/IEEE Design Automation Conference10.1145/74382.74476(561-567)Online publication date: 1-Jun-1989
https://dl.acm.org/doi/10.1145/74382.74476

Abstract

Cited By

Index Terms

Recommendations

Determining the K Most Critical Paths in PERT Networks

Fractional routing using pairs of failure-disjoint paths

Improved algorithms for the k simple shortest paths and the replacement paths problems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations