Fault-aware Scheduling

Fault-Aware Scheduling is a scheduling paradigm in distributed heterogeneous systems that belongs to the class of resource management strategies and is distinguished by its explicit incorporation of fault probability, resilience requirements, and system reliability characteristics into the task assignment and execution timeline decisions to minimize service disruptions and performance degradation.

142

Publications

4.6K

Citations

397

Authors

201

Institutions

Publications per year

2017–2026

45

Variants

Fault Aware Scheduling

Authors

397

  1. HD
    Helen D. Karatza

    Aristotle University of Thessaloniki, Greece

    5 publications · 106 citations

    5

    h-index

  2. GL
    Georgios L. Stavrinides

    Aristotle University of Thessaloniki, Greece

    4 publications · 91 citations

    4

    h-index

  3. TW
    Tongquan Wei

    East China Normal University, China

    4 publications · 121 citations

    4

    h-index

  4. ST
    Sofiène Tahar

    Concordia University, Canada

    3 publications · 86 citations

    3

    h-index

  5. AJ
    Adam J. Oliner

    University of California, Berkeley, United States

    3 publications · 170 citations

    3

    h-index

1–5 of 397

Venues

  1. Journal of Parallel and Distributed Computing

    7 publications · 251 citations

    7

    h-index

  2. The Journal of Supercomputing

    6 publications · 127 citations

    6

    h-index

  3. Future Generation Computer Systems

    FGCS · 5 publications · 143 citations

    5

    h-index

  4. IEEE Access

    4 publications · 121 citations

    4

    h-index

  5. IEEE Transactions on Computers

    3 publications · 310 citations

    3

    h-index

1–5