Multiprocessor Schedulability

Multiprocessor Schedulability is a schedulability analysis framework that determines whether a given set of real-time tasks can meet their deadlines when executed on a multiprocessor system, distinguishing it from uniprocessor schedulability by accounting for task allocation, migration, and interference across multiple processing units.

377

Publications

20.6K

Citations

574

Authors

254

Institutions

Publications per year

2017–2026

43

Authors

574

  1. SB
    Sanjoy Baruah

    University of North Carolina at Chapel Hill, United States

    28 publications · 3.2K citations

    20

    h-index

  2. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    27 publications · 1.7K citations

    19

    h-index

  3. BB
    Björn B. Brandenburg

    Max Planck Institute for Software Systems, Germany

    17 publications · 729 citations

    14

    h-index

  4. MB
    Marko Bertogna

    University of Modena and Reggio Emilia, Italy

    13 publications · 1.1K citations

    13

    h-index

  5. JG
    Joël Goossens

    Université Libre de Bruxelles, Belgium

    16 publications · 489 citations

    13

    h-index

1–5 of 574

Venues

  1. IEEE Transactions on Computers

    16 publications · 1.2K citations

    14

    h-index

  2. Real-Time Systems

    15 publications · 690 citations

    14

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 12 publications · 760 citations

    11

    h-index

  4. ACM Transactions on Embedded Computing Systems

    TECS · 7 publications · 129 citations

    7

    h-index

  5. Information Processing Letters

    7 publications · 408 citations

    7

    h-index

1–5