Task Set Utilization Bounds

Task Set Utilization Bounds is a theoretical construct in real-time scheduling theory that defines the maximum aggregate processor utilization limit beyond which a given task set is guaranteed to be unschedulable under a specific scheduling algorithm.

21

Publications

2.4K

Citations

56

Authors

29

Institutions

Publications per year

2017–2026

2

Authors

56

  1. AK
    Aloysius K. Mok

    The University of Texas at Austin, United States

    2 publications · 61 citations

    2

    h-index

  2. GF
    Gerhard Fohler

    University of Kaiserslautern, Germany

    2 publications · 52 citations

    2

    h-index

  3. MN
    Mitra Nasri

    Max Planck Institute for Software Systems, Germany

    2 publications · 52 citations

    2

    h-index

  4. DC
    Deji Chen

    The University of Texas at Austin, United States

    2 publications · 61 citations

    2

    h-index

  5. GQ
    Gang Quan

    Florida International University, United States

    2 publications · 40 citations

    2

    h-index

1–5 of 56

Venues

  1. IEEE Transactions on Computers

    3 publications · 157 citations

    3

    h-index

  2. ACM Transactions on Embedded Computing Systems

    TECS · 1 publications · 202 citations

    1

    h-index

  3. Computers & Electrical Engineering

    1 publications · 25 citations

    1

    h-index

  4. Journal of Systems and Software

    JSS · 1 publications · 15 citations

    1

    h-index

  5. 1

    h-index

1–5