Preemptive Scheduling

Preemptive Scheduling is a scheduling strategy in which a running task may be interrupted and temporarily displaced from a processing unit to allow a higher-priority task to execute, thereby distinguishing it from non-preemptive strategies that require tasks to complete or voluntarily yield control.

988

Publications

50.1K

Citations

1.7K

Authors

655

Institutions

Publications per year

2017–2026

109

Authors

1.7K

  1. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    39 publications · 3.6K citations

    27

    h-index

  2. RI
    Robert I. Davis

    University of York, United Kingdom

    27 publications · 1.8K citations

    18

    h-index

  3. AB
    Alan Burns

    University of York, United Kingdom

    25 publications · 1.8K citations

    18

    h-index

  4. MB
    Marko Bertogna

    University of Modena and Reggio Emilia, Italy

    18 publications · 1.1K citations

    16

    h-index

  5. GB
    Giorgio Buttazzo

    Scuola Superiore Sant'Anna, Italy

    15 publications · 1.1K citations

    15

    h-index

1–5 of 1.7K

Venues

  1. Real-Time Systems

    33 publications · 2.9K citations

    22

    h-index

  2. European Journal of Operational Research

    34 publications · 1.4K citations

    21

    h-index

  3. IEEE Transactions on Computers

    21 publications · 1.7K citations

    18

    h-index

  4. Operations Research Letters

    22 publications · 574 citations

    17

    h-index

  5. SIAM Journal on Computing

    15 publications · 1.1K citations

    15

    h-index

1–5