Fixed-priority Scheduling Analysis

Fixed-Priority Scheduling Analysis is a formal analytical method in real-time systems engineering that determines the schedulability of a set of tasks under a fixed-priority assignment policy, where priorities are statically assigned and remain invariant during execution.

191

Publications

12.6K

Citations

298

Authors

149

Institutions

Publications per year

2017–2026

23

Authors

298

  1. RI
    Robert I. Davis

    University of York, United Kingdom

    23 publications · 1.7K citations

    17

    h-index

  2. AB
    Alan Burns

    University of York, United Kingdom

    21 publications · 2.3K citations

    16

    h-index

  3. GB
    Giorgio Buttazzo

    Scuola Superiore Sant'Anna, Italy

    13 publications · 976 citations

    13

    h-index

  4. MB
    Marko Bertogna

    University of Modena and Reggio Emilia, Italy

    11 publications · 730 citations

    11

    h-index

  5. JC
    Jian-Jia Chen

    TU Dortmund University, Germany

    8 publications · 178 citations

    8

    h-index

1–5 of 298

Venues

  1. Real-Time Systems

    17 publications · 1.8K citations

    15

    h-index

  2. IEEE Transactions on Computers

    12 publications · 990 citations

    12

    h-index

  3. Journal of Systems and Software

    JSS · 5 publications · 86 citations

    5

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 4 publications · 625 citations

    4

    h-index

  5. Information Processing Letters

    4 publications · 290 citations

    4

    h-index

1–5