Non-preemptive Scheduling

Non-Preemptive Scheduling is a CPU scheduling discipline in which a running process retains the processor until it terminates or voluntarily yields (e.g., by entering a waiting state), and is never forcibly preempted by the operating system in favor of another ready process.

361

Publications

15.9K

Citations

695

Authors

319

Institutions

Publications per year

2017–2026

60

Authors

695

  1. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    17 publications · 896 citations

    16

    h-index

  2. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    10 publications · 506 citations

    10

    h-index

  3. BB
    Björn B. Brandenburg

    Max Planck Institute for Software Systems, Germany

    11 publications · 471 citations

    10

    h-index

  4. RI
    Robert I. Davis

    University of York, United Kingdom

    10 publications · 251 citations

    10

    h-index

  5. MN
    Mitra Nasri

    Max Planck Institute for Software Systems, Germany

    10 publications · 219 citations

    10

    h-index

1–5 of 695

Venues

  1. SIAM Journal on Computing

    9 publications · 868 citations

    9

    h-index

  2. Real-Time Systems

    9 publications · 496 citations

    9

    h-index

  3. European Journal of Operational Research

    7 publications · 331 citations

    7

    h-index

  4. ACM SIGMETRICS Performance Evaluation Review

    PER · 7 publications · 278 citations

    7

    h-index

  5. Discrete Applied Mathematics

    5 publications · 296 citations

    5

    h-index

1–5