Exact Schedulability Tests

Exact Schedulability Tests is a schedulability analysis method that precisely determines whether a set of periodic real-time tasks scheduled under the Rate Monotonic Scheduling policy will always meet their deadlines, without introducing pessimism inherent in sufficient-only tests.

45

Publications

2.1K

Citations

96

Authors

70

Institutions

Publications per year

2017–2026

7

Authors

96

  1. AB
    Alan Burns

    University of York, United Kingdom

    7 publications · 690 citations

    7

    h-index

  2. JG
    Joël Goossens

    Université Libre de Bruxelles, Belgium

    4 publications · 182 citations

    4

    h-index

  3. EB
    Enrico Bini

    Scuola Superiore Sant'Anna, Italy

    4 publications · 291 citations

    4

    h-index

  4. FZ
    Fengxiang Zhang

    University of York, United Kingdom

    3 publications · 256 citations

    3

    h-index

  5. MN
    Mitra Nasri

    Max Planck Institute for Software Systems, Germany

    3 publications · 113 citations

    3

    h-index

1–5 of 96

Venues

  1. IEEE Transactions on Computers

    7 publications · 686 citations

    7

    h-index

  2. Real-Time Systems

    2 publications · 36 citations

    2

    h-index

  3. ACM Transactions on Embedded Computing Systems

    TECS · 2 publications · 38 citations

    2

    h-index

  4. Journal of Systems Architecture

    JSA · 1 publications · 27 citations

    1

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 23 citations

    1

    h-index

1–5