Critical Path Scheduling is an instruction scheduling technique that prioritizes the scheduling of instructions along the longest latency path (critical path) in the data dependency graph to minimize overall execution time.
349
Publications
23.7K
Citations
802
Authors
372
Institutions
Publications per year
2017–2026
78
Parents
Publications
349
Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul et al. · 1995 · 1K citations · Full text
1–5 of 349
Authors
802
- TH
6
h-index
- DA
6
h-index
- GL
5
h-index
- JM
5
h-index
- LW
4
h-index
1–5 of 802
Institutions
372
Purdue University West Lafayette
West Lafayette, United States
9 h-index
11 publications
799 citations
University of Waterloo
Waterloo, Canada
9 h-index
21 publications
996 citations
University of Michigan
Ann Arbor, United States
8 h-index
11 publications
1.4K citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
7 publications
708 citations
University of California, Berkeley
Berkeley, United States
7 h-index
12 publications
1K citations
Virginia Tech
Blacksburg, United States
7 h-index
13 publications
426 citations
Delft University of Technology
Delft, The Netherlands
6 h-index
8 publications
850 citations
Tsinghua University
Beijing, China
6 h-index
11 publications
929 citations
1–8 of 372
Venues
- Journal of Construction Engineering and Management
54 publications · 4.2K citations
35
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 7 publications · 2K citations
7
h-index
- Operations Research
6 publications · 1.7K citations
6
h-index
- International Journal of Production Research
5 publications · 161 citations
5
h-index
- IEEE Transactions on Computers
5 publications · 639 citations
5
h-index
1–5