Instruction Scheduling Algorithms
Instruction Scheduling Algorithms is a computational method within processor architecture that determines the optimal execution order of instructions to maximize parallelism and resource utilization while preserving program semantics, differing from other instruction-level optimization techniques by explicitly reordering operations to resolve data and control dependencies in out-of-order execution pipelines.
266
Publications
11K
Citations
542
Authors
181
Institutions
Publications per year
2017–2026
7
Parents
266
1–5 of 266
542
9
h-index
6
h-index
6
h-index
6
h-index
5
h-index
1–5 of 542
181
Hewlett-Packard (United States)
Palo Alto, United States
13 h-index
28 publications
1.9K citations
University of Wisconsin–Madison
Madison, United States
10 h-index
18 publications
630 citations
University of Michigan
Ann Arbor, United States
9 h-index
19 publications
848 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
8 h-index
16 publications
583 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
8 h-index
13 publications
699 citations
Intel (United States)
Santa Clara, United States
7 h-index
14 publications
948 citations
IBM (United States)
Armonk, United States
7 h-index
7 publications
424 citations
University of Washington
Seattle, United States
7 h-index
20 publications
585 citations
1–8 of 181
13 publications · 477 citations
11
h-index
7 publications · 483 citations
7
h-index
6 publications · 196 citations
6
h-index
5 publications · 351 citations
5
h-index
TODAES · 4 publications · 140 citations
4
h-index
1–5