Dynamic Scheduling Algorithms
Dynamic Scheduling Algorithms is a computational method in computer architecture that enables the reordering of instruction execution at runtime to exploit instruction-level parallelism, distinguished from static scheduling by its use of real-time data dependency analysis and hazard detection to optimize processor resource utilization.
667
Publications
31K
Citations
1.8K
Authors
697
Institutions
Publications per year
2017–2026
217
Parents
667
1–5 of 667
1.8K
7
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 1.8K
697

Centre National de la Recherche Scientifique
Paris, France
13 h-index
29 publications
1.3K citations

University of Massachusetts Amherst
Amherst Center, United States
10 h-index
18 publications
3.2K citations
University of California, Berkeley
Berkeley, United States
10 h-index
14 publications
669 citations
National University of Singapore
Singapore, Singapore
10 h-index
26 publications
436 citations

National University of Defense Technology
Changsha, China
9 h-index
32 publications
1K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
9 h-index
16 publications
769 citations
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
12 publications
588 citations

Chinese Academy of Sciences
Beijing, China
8 h-index
23 publications
729 citations
1–8 of 697
20 publications · 1K citations
17
h-index
TPDS · 15 publications · 2K citations
14
h-index
12 publications · 365 citations
11
h-index
8 publications · 508 citations
8
h-index
8 publications · 1.1K citations
8
h-index
1–5