Utilization Bounds

Utilization Bounds is a metric in real-time scheduling theory that specifies the maximum total CPU utilization of a set of periodic tasks for which a given scheduling algorithm, such as Rate Monotonic Scheduling, can always guarantee feasibility.

94

Publications

6.7K

Citations

164

Authors

92

Institutions

Publications per year

2017–2026

3

Variants

Utilization Bound

Authors

164

  1. CL
    Chenyang Lu

    Washington University in St. Louis, United States

    7 publications · 550 citations

    7

    h-index

  2. TA
    Tarek Abdelzaher

    University of Illinois Urbana-Champaign, United States

    7 publications · 345 citations

    7

    h-index

  3. NG
    Nan Guan

    Northeastern University, China

    5 publications · 203 citations

    5

    h-index

  4. AK
    Aloysius K. Mok

    The University of Texas at Austin, United States

    5 publications · 377 citations

    5

    h-index

  5. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    5 publications · 343 citations

    5

    h-index

1–5 of 164

Venues

  1. IEEE Transactions on Computers

    7 publications · 451 citations

    7

    h-index

  2. European Journal of Operational Research

    3 publications · 378 citations

    3

    h-index

  3. Information Processing Letters

    2 publications · 32 citations

    2

    h-index

  4. Advances in Applied Probability

    AAP · 2 publications · 59 citations

    2

    h-index

  5. Real-Time Systems

    2 publications · 192 citations

    2

    h-index

1–5