Processor Utilization Bounds is a theoretical metric in real-time scheduling analysis that specifies the maximum total utilization of a set of periodic tasks for which the Earliest Deadline First scheduling algorithm can guarantee schedulability on a uniprocessor system.
118
Publications
14.4K
Citations
221
Authors
115
Institutions
Publications per year
2017–2026
9
Publications
118
Multiprocessor EDF and deadline monotonic schedulability analysis
T. P. Baker · 2004 · 269 citations
Load adjustment in adaptive real-time systems
Tei‐Wei Kuo, Aloysius K. Mok · 2002 · 204 citations
1–5 of 118
Authors
221
- WY
7
h-index
- NG
7
h-index
- BA
6
h-index
- CL
6
h-index
- SBSanjoy Baruah
University of North Carolina at Chapel Hill, United States
6 publications · 355 citations
6
h-index
1–5 of 221
Institutions
115
University of North Carolina at Chapel Hill
Chapel Hill, United States
11 h-index
20 publications
1.6K citations
Washington University in St. Louis
St Louis, United States
7 h-index
14 publications
959 citations
Uppsala University
Uppsala, Sweden
6 h-index
13 publications
512 citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
8 publications
8.6K citations
The University of Texas at Austin
Austin, United States
6 h-index
10 publications
723 citations
Northeastern University
Shenyang, China
6 h-index
20 publications
806 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
14 publications
643 citations
Vanderbilt University
Nashville, United States
5 h-index
10 publications
498 citations
1–8 of 115
Venues
- IEEE Transactions on Computers
11 publications · 1K citations
11
h-index
- Real-Time Systems
6 publications · 321 citations
6
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 5 publications · 440 citations
5
h-index
- Journal of Systems Architecture
JSA · 3 publications · 132 citations
3
h-index
- Journal of the ACM
JACM · 2 publications · 8.4K citations
2
h-index
1–5