Task Set Utilization Bounds
Task Set Utilization Bounds is a theoretical construct in real-time scheduling theory that defines the maximum aggregate processor utilization limit beyond which a given task set is guaranteed to be unschedulable under a specific scheduling algorithm.
21
Publications
2.4K
Citations
56
Authors
29
Institutions
Publications per year
2017–2026
2
Parents
21
Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks
Jing Li, Kunal Agrawal, Chenyang Lu et al. · 2013 · 104 citations
1–5 of 21
56
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 56
29
University of Aveiro
Aveiro, Portugal
2 h-index
2 publications
45 citations
The Ohio State University
Columbus, United States
2 h-index
4 publications
306 citations

University of York
York, United Kingdom
2 h-index
4 publications
220 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
61 citations
University of Kaiserslautern
Kaiserslautern, Germany
2 h-index
3 publications
82 citations

Illinois Institute of Technology
Chicago, United States
2 h-index
5 publications
85 citations
Florida International University
Miami, United States
2 h-index
3 publications
65 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
5 publications
4.4K citations
1–8 of 29
3 publications · 157 citations
3
h-index
TECS · 1 publications · 202 citations
1
h-index
1 publications · 25 citations
1
h-index
JSS · 1 publications · 15 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5