Fair Scheduling

Fair Scheduling is a scheduling paradigm that belongs to the class of resource allocation mechanisms and is distinguished by its enforcement of equitable access to computational resources among competing processes or threads, ensuring that no entity is indefinitely postponed and that system utilization is balanced with fairness criteria such as proportionality, strategyproofness, or temporal isolation.

886

Publications

48.2K

Citations

2K

Authors

641

Institutions

Publications per year

2017–2026

126

Authors

2K

  1. IS
    Ion Stoica

    University of California, Berkeley, United States

    13 publications · 3.6K citations

    13

    h-index

  2. BL
    Baochun Li

    University of Toronto, Canada

    12 publications · 595 citations

    12

    h-index

  3. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    12 publications · 610 citations

    12

    h-index

  4. RS
    R. Srikant

    University of Illinois Urbana-Champaign, United States

    9 publications · 1.2K citations

    9

    h-index

  5. MH
    Mor Harchol‐Balter

    Carnegie Mellon University, United States

    8 publications · 840 citations

    8

    h-index

1–5 of 2K

Venues

  1. IEEE Transactions on Wireless Communications

    31 publications · 1.9K citations

    23

    h-index

  2. IEEE/ACM Transactions on Networking

    TON · 21 publications · 3.6K citations

    18

    h-index

  3. IEEE Communications Letters

    22 publications · 1K citations

    17

    h-index

  4. IEEE Transactions on Vehicular Technology

    20 publications · 929 citations

    15

    h-index

  5. IEEE Journal on Selected Areas in Communications

    14 publications · 1.3K citations

    13

    h-index

1–5