Skip to search formSkip to main contentSkip to account menu

Critical path method

Known as: CPM, Critical Path, Path analysis (business) 
The critical path method (CPM) is an algorithm for scheduling a set of project activities.
Wikipedia (opens in a new tab)

Related topics

Related topics

29 relations
AlgorithmAmdahl's lawBottleneck (engineering)Critical graph

Broader (2)

Network theoryOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Low-Latency Successive-Cancellation Polar Decoder Architectures Using 2-Bit Decoding
Polar codes have emerged as important error correction codes due to their capacity-achieving property. Successive cancellation… 
Highly Cited
2013
Highly Cited
2013
Memory-Efficient Hardware Architecture of 2-D Dual-Mode Lifting-Based Discrete Wavelet Transform
Memory requirements (for storing intermediate signals) and critical path are essential issues for 2-D (or multidimensional… 
Highly Cited
2012
Highly Cited
2012
Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
In this paper we present an FPGA implementation of a high-speed elliptic curve scalar multiplier for binary finite fields. High… 
2009
2009
Dynamic parallelization of single-threaded binary programs using speculative slicing
The performance of single-threaded programs and legacy binary code is of critical importance in many everyday applications… 
Highly Cited
2008
Highly Cited
2008
Power and Area-Efficient Unified Computation of Vector and Elementary Functions for Handheld 3D Graphics Systems
A unified computation method of vector and elementary functions is proposed for handheld 3D graphics systems. It unifies vector… 
2008
2008
A Highly Efficient VLSI Architecture for H.264/AVC CAVLC Decoder
In this paper, an efficient algorithm is proposed to improve the decoding efficiency of the context-based adaptive variable… 
Highly Cited
2007
Highly Cited
2007
Variation-Aware Adaptive Voltage Scaling System
Conventional voltage scaling systems require a delay margin to maintain a certain level of robustness across all possible device… 
Highly Cited
2001
Highly Cited
2001
Reducing power with dynamic critical path information
Recent research has shown that dynamic information regarding instruction criticality can be used to increase microprocessor… 
Highly Cited
1984
Highly Cited
1984
Delay and Power Optimization in VLSI Circuits
The problem of optimally sizing the transistors in a digital MOS VLSI circuit is examined. Macro-models are developed and new… 
Highly Cited
1981
Highly Cited
1981
Why Projects Are “Always” Late: A Rationale Based on Manual Simulation of a PERT/CPM Network
The conventional procedure for determining the expected project completion time is to find the critical path; its duration is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)