Shortest Remaining Processing Time
Shortest Remaining Processing Time is a preemptive scheduling discipline that belongs to the class of queue prioritization policies, distinguished by selecting for execution the process with the least remaining burst time, thereby enabling dynamic reordering in response to newly arrived or ongoing tasks.
37
Publications
1.5K
Citations
80
Authors
41
Institutions
Publications per year
2017–2026
5
Variants
Srpt
37
Is Tail-Optimal Scheduling Possible?
Adam Wierman, Bert Zwart · Operations Research · 2012 · 87 citations
1–5 of 37
80
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 80
41
Columbia University
New York, United States
3 h-index
5 publications
160 citations
University of California, Berkeley
Berkeley, United States
3 h-index
8 publications
294 citations
University of Cambridge
Cambridge, United Kingdom
3 h-index
4 publications
347 citations
California Institute of Technology
Pasadena, United States
3 h-index
3 publications
148 citations
Michigan State University
East Lansing, United States
2 h-index
3 publications
55 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
5 publications
72 citations
University of Virginia
Charlottesville, United States
2 h-index
4 publications
54 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
54 citations
1–8 of 41
4 publications · 549 citations
4
h-index
3 publications · 173 citations
3
h-index
JAP · 2 publications · 105 citations
2
h-index
PER · 2 publications · 27 citations
2
h-index
1 publications · 26 citations
1
h-index
1–5