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

Authors

14

  1. RW
    Ronald W. Wolff

    University of California, Berkeley, United States

    2 publications · 96 citations

    2

    h-index

  2. SM
    S. Mukherjee

    Intel (United States), United States

    2 publications · 81 citations

    2

    h-index

  3. DS
    Debashis Saha

    Indian Institute of Management Calcutta, India

    2 publications · 81 citations

    2

    h-index

  4. CA
    Chen Avin

    Ben-Gurion University of the Negev, Israel

    1 publications · 23 citations

    1

    h-index

  5. SK
    Satish K. Tripathi

    University of Maryland, College Park, United States

    1 publications · 18 citations

    1

    h-index

1–5 of 14

Venues

  1. Journal of Applied Probability

    JAP · 2 publications · 96 citations

    2

    h-index

  2. IRE Transactions on Communications Systems

    1 publications · 18 citations

    1

    h-index

  3. 1

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 1 publications · 63 citations

    1

    h-index

1–4