Non-preemptive Scheduling Analysis

Non-Preemptive Scheduling Analysis is a method in deadline analysis that evaluates task schedulability in real-time systems where tasks, once initiated, are not interrupted until completion, distinguishing it from preemptive approaches that allow task suspension to accommodate higher-priority arrivals.

125

Publications

6.8K

Citations

268

Authors

125

Institutions

Publications per year

2017–2026

14

Authors

268

  1. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    9 publications · 375 citations

    9

    h-index

  2. RI
    Robert I. Davis

    University of York, United Kingdom

    8 publications · 199 citations

    8

    h-index

  3. AB
    Alan Burns

    University of York, United Kingdom

    5 publications · 133 citations

    5

    h-index

  4. YS
    Yves Sorel

    Institut national de recherche en sciences et technologies du numérique, France

    4 publications · 79 citations

    4

    h-index

  5. MB
    Marko Bertogna

    University of Modena and Reggio Emilia, Italy

    4 publications · 136 citations

    4

    h-index

1–5 of 268

Venues

  1. Real-Time Systems

    9 publications · 1.1K citations

    9

    h-index

  2. European Journal of Operational Research

    4 publications · 117 citations

    4

    h-index

  3. Journal of Systems Architecture

    JSA · 3 publications · 183 citations

    3

    h-index

  4. Journal of Scheduling

    JOS · 3 publications · 62 citations

    3

    h-index

  5. Journal of Applied Probability

    JAP · 2 publications · 105 citations

    2

    h-index

1–5