Work-conserving Scheduling
Work-Conserving Scheduling is a CPU scheduling discipline that belongs to the class of resource allocation strategies and is distinguished by the property that it always schedules a process to execute whenever at least one process is ready and the processor is idle, thereby minimizing idle time without introducing artificial delays.
52
Publications
2.3K
Citations
131
Authors
76
Institutions
Publications per year
2017–2026
6
52
Sitaram Iyer, Peter Druschel · 2001 · 235 citations
Ensuring the QoS requirements in 802.16 scheduling
Alexander Sayenko, Olli Alanen, Juha Karhula et al. · 2006 · 170 citations
Is Tail-Optimal Scheduling Possible?
Adam Wierman, Bert Zwart · Operations Research · 2012 · 87 citations
1–5 of 52
131
Korea Advanced Institute of Science and Technology, South Korea
2 publications · 41 citations
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 131
76
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
9 publications
463 citations

Universitat Jaume I
Castellon, Spain
2 h-index
3 publications
56 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
96 citations
Technische Universität Braunschweig
Braunschweig, Germany
2 h-index
7 publications
140 citations
University of Kaiserslautern
Kaiserslautern, Germany
2 h-index
4 publications
56 citations

Rice University
Houston, United States
2 h-index
4 publications
514 citations
IBM (United States)
Armonk, United States
2 h-index
7 publications
174 citations
Nanyang Technological University
Singapore, Singapore
2 h-index
2 publications
54 citations
1–8 of 76
2 publications · 35 citations
2
h-index
JAP · 2 publications · 96 citations
2
h-index
TON · 2 publications · 82 citations
2
h-index
2 publications · 152 citations
2
h-index
1 publications · 42 citations
1
h-index
1–5