Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,792,149 papers from all fields of science
Search
Sign In
Create Free Account
Critical path method
Known as:
CPM
, Critical Path
, Path analysis (business)
Expand
The critical path method (CPM) is an algorithm for scheduling a set of project activities.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Algorithm
Amdahl's law
Bottleneck (engineering)
Critical graph
Expand
Broader (2)
Network theory
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
All-Digital Adaptive Clocking to Tolerate Transient Supply Noise in a Low-Voltage Operation
Kwanyeob Chae
,
S. Mukhopadhyay
IEEE Transactions on Circuits and Systems - II…
2012
Corpus ID: 36738637
This paper presents an all-digital technique to modulate the system clock and local clocks in response to global and local…
Expand
2011
2011
Re-synthesis for cost-efficient circuit-level timing speculation
Yuxi Liu
,
Feng Yuan
,
Q. Xu
Design Automation Conference
2011
Corpus ID: 9257061
As the transistor feature size is continuously scaled down, integrated circuits are more vulnerable to process, voltage and…
Expand
2010
2010
A Novel VLSI Architecture of Fixed-Complexity Sphere Decoder
Bin Wu
,
G. Masera
13th Euromicro Conference on Digital System…
2010
Corpus ID: 4875516
Fixed-complexity Sphere Decoder (FSD) is a recently proposed technique for Multiple-Input Multiple-Output (MIMO) detection. It…
Expand
2009
2009
Dynamic parallelization of single-threaded binary programs using speculative slicing
Cheng Wang
,
Youfeng Wu
,
+5 authors
J. Fang
International Conference on Supercomputing
2009
Corpus ID: 14507812
The performance of single-threaded programs and legacy binary code is of critical importance in many everyday applications…
Expand
2009
2009
Projects' Analysis through CPM (Critical Path Method)
Peter Stelth
,
G. L. Roy
2009
Corpus ID: 111059138
CPM, a technique for analyzing projects by determining the longest sequence of tasks (or the sequence of task with the least…
Expand
2004
2004
Simultaneous scheduling, binding and layer assignment for synthesis of vertically integrated 3D systems
M. Mukherjee
,
R. Vemuri
IEEE International Conference on Computer Design…
2004
Corpus ID: 10011914
Three-dimensional vertically integrated systems allow active devices to be placed on multiple device layers. In recent years, a…
Expand
2001
2001
Cost-effective hardware acceleration of multimedia applications
D. Talla
,
L. John
Proceedings IEEE International Conference on…
2001
Corpus ID: 17294985
General-purpose microprocessors augmented with SIMD execution units enhance multimedia applications by exploiting data level…
Expand
2000
2000
On some implementation issues for value prediction on wide-issue ILP processors
Sang Jeong Lee
,
P. Yew
Proceedings International Conference on Parallel…
2000
Corpus ID: 5627544
In this paper we look at two issues which could affect the performance of value prediction on wide-issue ILP processors. One is…
Expand
1999
1999
© Copyright Hewlett-Packard Company 1999Control CPR: A Branch Height Reduction Optimization for EPIC Architectures
1999
Corpus ID: 8131681
1998
1998
DRIL: dynamically reduced message injection limitation mechanism for wormhole networks
P. López
,
Juan-Miguel Martínez
,
J. Duato
Proceedings of the International Conference on…
1998
Corpus ID: 34184719
Deadlock avoidance and recovery techniques are alternatives to deal with the interconnection network deadlock problem. Both…
Expand