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

Authors

131

  1. IS
    Insik Shin

    Korea Advanced Institute of Science and Technology, South Korea

    2 publications · 41 citations

    2

    h-index

  2. PD
    Peter Druschel

    Rice University, United States

    2 publications · 257 citations

    2

    h-index

  3. SI
    Sitaram Iyer

    Rice University, United States

    2 publications · 257 citations

    2

    h-index

  4. RE
    Rolf Ernst

    Technische Universität Braunschweig, Germany

    2 publications · 40 citations

    2

    h-index

  5. SM
    S. Mukherjee

    Intel (United States), United States

    2 publications · 81 citations

    2

    h-index

1–5 of 131

Venues

  1. IEEE Communications Letters

    2 publications · 35 citations

    2

    h-index

  2. Journal of Applied Probability

    JAP · 2 publications · 96 citations

    2

    h-index

  3. IEEE/ACM Transactions on Networking

    TON · 2 publications · 82 citations

    2

    h-index

  4. Operations Research

    2 publications · 152 citations

    2

    h-index

  5. Manufacturing & Service Operations Management

    1 publications · 42 citations

    1

    h-index

1–5