Overload Scheduling
Overload Scheduling is a real-time scheduling strategy that belongs to the class of scheduling methods designed for handling temporal violations, distinguished by its explicit prioritization and management of task execution during periods when the total computational demand exceeds the available processing capacity.
62
Publications
2.8K
Citations
164
Authors
78
Institutions
Publications per year
2017–2026
7
Parents
62
Implications of classical scheduling results for real-time systems
John A. Stankovic, Marco Spuri, Marco Di Natale et al. · Computer · 1995 · 393 citations
On-line scheduling in the presence of overload
Sanjoy Baruah, G. Koren, Bud Mishra et al. · 2002 · 143 citations
Bianca Schroeder, Mor Harchol‐Balter · ACM Transactions on Internet Technology · 2006 · 140 citations
1–5 of 62
164
University of North Carolina at Chapel Hill, United States
4 publications · 273 citations
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 164
78
IBM (United States)
Armonk, United States
4 h-index
8 publications
252 citations
University of Maryland, College Park
College Park, United States
3 h-index
4 publications
62 citations

University of Vermont
Burlington, United States
3 h-index
3 publications
186 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
8 publications
244 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
5 publications
340 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
5 publications
663 citations
New York University
New York, United States
2 h-index
5 publications
663 citations

Scuola Superiore Sant'Anna
Pisa, Italy
2 h-index
9 publications
1.8K citations
1–8 of 78
4 publications · 200 citations
4
h-index
2 publications · 66 citations
2
h-index
1 publications · 26 citations
1
h-index
1 publications · 32 citations
1
h-index
1 publications · 26 citations
1
h-index
1–5