Schedulability Analysis

Schedulability Analysis is a real-time systems timing analysis technique that determines, under specified task, resource, and scheduling assumptions, whether all tasks in a system can always satisfy their deadlines or other temporal constraints.

2.9K

Publications

157.3K

Citations

3.7K

Authors

1.1K

Institutions

Publications per year

2017–2026

379

Authors

3.7K

  1. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    99 publications · 7.9K citations

    47

    h-index

  2. AB
    Alan Burns

    University of York, United Kingdom

    69 publications · 6.8K citations

    36

    h-index

  3. GB
    Giorgio Buttazzo

    Scuola Superiore Sant'Anna, Italy

    62 publications · 5.3K citations

    34

    h-index

  4. RI
    Robert I. Davis

    University of York, United Kingdom

    49 publications · 3.3K citations

    29

    h-index

  5. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    51 publications · 3.2K citations

    28

    h-index

1–5 of 3.7K

Venues

  1. IEEE Transactions on Computers

    106 publications · 6.9K citations

    45

    h-index

  2. Real-Time Systems

    94 publications · 10K citations

    44

    h-index

  3. IEEE Transactions on Software Engineering

    TSE · 58 publications · 6.5K citations

    36

    h-index

  4. IEEE Transactions on Industrial Informatics

    27 publications · 1.7K citations

    22

    h-index

  5. ACM Transactions on Embedded Computing Systems

    TECS · 49 publications · 3.4K citations

    22

    h-index

1–5