Request Scheduling
Request Scheduling is a computational resource management strategy that determines the optimal order and timing of processing incoming requests in a system to minimize latency, prioritize critical tasks, and maximize throughput under constrained resources.
216
Publications
10.5K
Citations
591
Authors
248
Institutions
Publications per year
2017–2026
50
Parents
216
Competitive algorithms for on-line problems
Mark S. Manasse, Lyle A. McGeoch, Daniel D. Sleator · 1988 · 356 citations
Size-based scheduling to improve web performance
Mor Harchol‐Balter, Bianca Schroeder, Nikhil Bansal et al. · ACM Transactions on Computer Systems · 2003 · 314 citations
Sitaram Iyer, Peter Druschel · 2001 · 235 citations
1–5 of 216
591
7
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 591
248
Carnegie Mellon University
Pittsburgh, United States
10 h-index
26 publications
3.8K citations

Beijing University of Posts and Telecommunications
Beijing, China
9 h-index
27 publications
1.1K citations

City University of Hong Kong
Hong Kong, Hong Kong
7 h-index
14 publications
299 citations
IBM (United States)
Armonk, United States
7 h-index
13 publications
465 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
7 h-index
12 publications
2.6K citations
Purdue University West Lafayette
West Lafayette, United States
7 h-index
13 publications
256 citations
The University of Texas at Dallas
Richardson, United States
6 h-index
12 publications
237 citations

Pennsylvania State University
State College, United States
6 h-index
14 publications
1.9K citations
1–8 of 248
TNSM · 5 publications · 117 citations
5
h-index
TPDS · 5 publications · 296 citations
5
h-index
4 publications · 139 citations
4
h-index
TMCCI · 3 publications · 282 citations
3
h-index
3 publications · 58 citations
3
h-index
1–5