List Scheduling
List Scheduling is an instruction scheduling algorithm that belongs to the class of greedy heuristic methods, distinguished by its systematic construction of an ordered list of instructions based on static priorities derived from data dependencies and resource constraints to optimize execution in pipelined processors.
184
Publications
9.9K
Citations
438
Authors
217
Institutions
Publications per year
2017–2026
27
Parents
184
1–5 of 184
438
4
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 438
217
University of Washington
Seattle, United States
6 h-index
9 publications
251 citations

University of Cincinnati
Cincinnati, United States
5 h-index
14 publications
236 citations
Hewlett-Packard (United States)
Palo Alto, United States
4 h-index
9 publications
296 citations
University of California, Riverside
Riverside, United States
4 h-index
8 publications
173 citations
Technische Universität Berlin
Berlin, Germany
4 h-index
4 publications
734 citations
National Tsing Hua University
Hsinchu, Taiwan
4 h-index
8 publications
1.5K citations

École Normale Supérieure de Lyon
Lyon, France
4 h-index
8 publications
277 citations

Chongqing University
Chongqing, China
4 h-index
15 publications
1.6K citations
1–8 of 217
TPDS · 10 publications · 1.6K citations
10
h-index
5 publications · 318 citations
5
h-index
4 publications · 202 citations
4
h-index
4 publications · 289 citations
4
h-index
4 publications · 128 citations
4
h-index
1–5