Non-preemptive Scheduling Model

A Non-Preemptive Scheduling Model is a task scheduling model in which once a task is assigned to a processing unit, it must execute to completion without interruption or rescheduling until termination.

81

Publications

4.3K

Citations

206

Authors

120

Institutions

Publications per year

2017–2026

20

Authors

206

  1. MN
    Mitra Nasri

    Max Planck Institute for Software Systems, Germany

    3 publications · 51 citations

    3

    h-index

  2. YL
    Yupeng Li

    University of Hong Kong, Hong Kong SAR China

    2 publications · 29 citations

    2

    h-index

  3. NR
    Nicolas Rivierre

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

    2 publications · 330 citations

    2

    h-index

  4. MS
    M. Saksena

    Concordia University, Canada

    2 publications · 288 citations

    2

    h-index

  5. PV
    Pravin Varaiya

    University of California, Berkeley, United States

    2 publications · 105 citations

    2

    h-index

1–5 of 206

Venues

  1. Real-Time Systems

    3 publications · 170 citations

    4

    h-index

  2. Journal of Applied Probability

    JAP · 3 publications · 117 citations

    3

    h-index

  3. IIE Transactions

    2 publications · 40 citations

    2

    h-index

  4. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 2 publications · 79 citations

    2

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 212 citations

    2

    h-index

1–5