Work-conserving Priority Queues
Work-Conserving Priority Queues is a queuing discipline within priority-based scheduling systems that belongs to the class of work-conserving algorithms by ensuring the service mechanism remains continuously active whenever there are jobs in the queue, distinguished by its strict adherence to priority ordering without introducing idle periods when work is pending.
7
Publications
268
Citations
14
Authors
18
Institutions
Publications per year
2017–2026
1
Parents
7
Ronald W. Wolff · Journal of Applied Probability · 1970 · 80 citations
1–5 of 7
14
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 14
18
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
96 citations

Washington State University
Pullman, United States
1 h-index
1 publications
18 citations
University of Maryland, College Park
College Park, United States
1 h-index
1 publications
18 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
50 citations
Siemens (Germany)
Munich, Germany
1 h-index
1 publications
23 citations
University of California, Riverside
Riverside, United States
1 h-index
1 publications
63 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
1 publications
18 citations
Panasonic (United States)
Newark, United States
1 h-index
1 publications
63 citations
1–8 of 18
JAP · 2 publications · 96 citations
2
h-index
1 publications · 18 citations
1
h-index
POMACS · 1 publications · 23 citations
1
h-index
TON · 1 publications · 63 citations
1
h-index
1–4