Priority Scheduling

Priority Scheduling is a preemptive or non-preemptive CPU scheduling algorithm in which the selection of the next process to execute is determined by a priority value assigned to each process, distinguishing it from other scheduling algorithms by its reliance on externally or internally defined priority levels rather than execution characteristics such as burst time or arrival order.

596

Publications

32.2K

Citations

1.4K

Authors

537

Institutions

Publications per year

2017–2026

123

Authors

1.4K

  1. AB
    Alan Burns

    University of York, United Kingdom

    25 publications · 2.3K citations

    18

    h-index

  2. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    18 publications · 1.5K citations

    16

    h-index

  3. RI
    Robert I. Davis

    University of York, United Kingdom

    22 publications · 1.8K citations

    16

    h-index

  4. MB
    Marko Bertogna

    University of Modena and Reggio Emilia, Italy

    12 publications · 444 citations

    12

    h-index

  5. GB
    Giorgio Buttazzo

    Scuola Superiore Sant'Anna, Italy

    9 publications · 646 citations

    9

    h-index

1–5 of 1.4K

Venues

  1. IEEE Transactions on Computers

    17 publications · 1.3K citations

    16

    h-index

  2. Real-Time Systems

    13 publications · 1.2K citations

    13

    h-index

  3. IEEE Transactions on Industrial Informatics

    9 publications · 558 citations

    9

    h-index

  4. IEEE Access

    10 publications · 451 citations

    9

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 171 citations

    8

    h-index

1–5