Fault-tolerant Scheduling

Fault-Tolerant Scheduling is a computational scheduling strategy that belongs to the class of fault tolerance techniques by incorporating redundancy, checkpointing, or task replication mechanisms to ensure system reliability and task completion in the presence of hardware or software failures.

787

Publications

28.6K

Citations

1.9K

Authors

709

Institutions

Publications per year

2017–2026

192

Authors

1.9K

  1. DM
    Daniel Mossé

    University of Pittsburgh, United States

    16 publications · 886 citations

    14

    h-index

  2. PE
    Petru Eles

    Linköping University, Sweden

    13 publications · 480 citations

    13

    h-index

  3. ZP
    Zebo Peng

    Linköping University, Sweden

    12 publications · 368 citations

    12

    h-index

  4. YR
    Yves Robert

    École Normale Supérieure de Lyon, France

    14 publications · 463 citations

    12

    h-index

  5. PP
    Paul Pop

    Technical University of Denmark, Denmark

    13 publications · 481 citations

    12

    h-index

1–5 of 1.9K

Venues

  1. IEEE Transactions on Computers

    30 publications · 2K citations

    25

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 22 publications · 1.9K citations

    20

    h-index

  3. Journal of Systems Architecture

    JSA · 14 publications · 545 citations

    13

    h-index

  4. Journal of Parallel and Distributed Computing

    16 publications · 846 citations

    13

    h-index

  5. Future Generation Computer Systems

    FGCS · 13 publications · 451 citations

    12

    h-index

1–5