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

Authors

164

  1. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    4 publications · 273 citations

    4

    h-index

  2. DS
    Dennis Shasha

    New York University, United States

    3 publications · 449 citations

    3

    h-index

  3. GK
    G. Koren

    Courant Institute of Mathematical Sciences, United States

    3 publications · 449 citations

    3

    h-index

  4. GB
    G. Burns

    IBM (United States), United States

    2 publications · 48 citations

    2

    h-index

  5. TL
    Tak‐Wah Lam

    University of Hong Kong, Hong Kong SAR China

    2 publications · 112 citations

    2

    h-index

1–5 of 164

Venues

  1. IEEE Transactions on Computers

    4 publications · 200 citations

    4

    h-index

  2. Journal of Parallel and Distributed Computing

    2 publications · 66 citations

    2

    h-index

  3. Expert Systems with Applications

    1 publications · 26 citations

    1

    h-index

  4. Procedia - Social and Behavioral Sciences

    1 publications · 32 citations

    1

    h-index

  5. Journal of Computer and System Sciences

    1 publications · 26 citations

    1

    h-index

1–5