Dynamic-priority Scheduling

Dynamic-Priority Scheduling is a CPU scheduling method in soft real-time systems that belongs to the class of priority-based scheduling algorithms, distinguished by its runtime adjustment of task priorities according to dynamic factors such as deadlines, remaining execution time, or system conditions.

190

Publications

10.2K

Citations

565

Authors

247

Institutions

Publications per year

2017–2026

51

Authors

565

  1. SL
    Sang Lyul Min

    Seoul National University, South Korea

    5 publications · 530 citations

    5

    h-index

  2. AC
    Alfons Crespo

    Universitat Politècnica de València, Spain

    5 publications · 162 citations

    5

    h-index

  3. IR
    Ismael Ripoll

    Universitat Politècnica de València, Spain

    4 publications · 152 citations

    4

    h-index

  4. PB
    Patricia Balbastre

    Universitat Politècnica de València, Spain

    4 publications · 111 citations

    4

    h-index

  5. LL
    Lucia Lo Bello

    University of Catania, Italy

    3 publications · 284 citations

    3

    h-index

1–5 of 565

Venues

  1. IEEE Transactions on Computers

    6 publications · 768 citations

    6

    h-index

  2. Real-Time Systems

    4 publications · 653 citations

    4

    h-index

  3. 4

    h-index

  4. Management Science

    3 publications · 139 citations

    3

    h-index

  5. European Journal of Operational Research

    3 publications · 726 citations

    3

    h-index

1–5