Throughput-aware Scheduling
Throughput-Aware Scheduling is a computational scheduling methodology that prioritizes the maximization of system throughput by dynamically allocating resources and ordering tasks based on their expected contribution to overall processing efficiency, distinguishing it from latency- or fairness-oriented scheduling strategies.
252
Publications
10.6K
Citations
683
Authors
284
Institutions
Publications per year
2017–2026
44
Parents
252
Balancing thoughput and fairness in SMT processors
Kun Luo, Jayanth Gummaraju, M. Franklin · 2005 · 247 citations
Shuang Chen, Christina Delimitrou, José F. Martínez · 2019 · 246 citations · Full text
1–5 of 252
683
7
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 683
284
The Ohio State University
Columbus, United States
11 h-index
25 publications
909 citations
The University of Texas at Austin
Austin, United States
8 h-index
16 publications
1.7K citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
14 publications
571 citations
Purdue University West Lafayette
West Lafayette, United States
7 h-index
14 publications
379 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
13 publications
266 citations
Stanford University
Stanford, United States
6 h-index
9 publications
706 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
6 h-index
10 publications
196 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
6 h-index
17 publications
287 citations
1–8 of 284
TON · 13 publications · 1K citations
12
h-index
6 publications · 220 citations
6
h-index
TPDS · 5 publications · 118 citations
5
h-index
5 publications · 139 citations
5
h-index
4 publications · 423 citations
4
h-index
1–5