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
94
1–5 of 94
164
7
h-index
University of Illinois Urbana-Champaign, United States
7 publications · 345 citations
7
h-index
5
h-index
5
h-index
University of North Carolina at Chapel Hill, United States
5 publications · 343 citations
5
h-index
1–5 of 164
92
University of North Carolina at Chapel Hill
Chapel Hill, United States
7 h-index
13 publications
948 citations

Washington University in St. Louis
St Louis, United States
7 h-index
13 publications
996 citations
University of Virginia
Charlottesville, United States
5 h-index
8 publications
544 citations
The University of Texas at Austin
Austin, United States
5 h-index
8 publications
693 citations
Texas A&M University
College Station, United States
5 h-index
14 publications
969 citations

Northeastern University
Shenyang, China
5 h-index
14 publications
587 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
8 publications
248 citations

Universidad de Oviedo
Oviedo, Spain
4 h-index
13 publications
1.6K citations
1–8 of 92
7 publications · 451 citations
7
h-index
3 publications · 378 citations
3
h-index
2 publications · 32 citations
2
h-index
AAP · 2 publications · 59 citations
2
h-index
2 publications · 192 citations
2
h-index
1–5