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
Parents
Children
Checkpointing SchedulingDeadlines-aware Fault-tolerant SchedulingDelay-tolerant Scheduling Under FailuresDistributed Fault-tolerant SchedulingDynamic Scheduling Under FailuresEnergy-aware Fault-tolerant SchedulingFault Recovery SchedulingFault-tolerant Resource AllocationFault-tolerant Task SchedulingFault-tolerant Workflow Scheduling
787
1–5 of 787
1.9K
14
h-index
13
h-index
12
h-index
12
h-index
12
h-index
1–5 of 1.9K
709
University of Pittsburgh
Pittsburgh, United States
15 h-index
36 publications
2.1K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
15 h-index
54 publications
1.5K citations

Linköping University
Linköping, Sweden
13 h-index
42 publications
1.5K citations

École Normale Supérieure de Lyon
Lyon, France
12 h-index
41 publications
1.3K citations

National University of Defense Technology
Changsha, China
11 h-index
45 publications
1.7K citations

Hunan University
Changsha, China
11 h-index
41 publications
3K citations
University of Michigan
Ann Arbor, United States
11 h-index
25 publications
1.3K citations
Laboratoire de l'Informatique du Parallélisme
Lyon, France
11 h-index
29 publications
801 citations
1–8 of 709
30 publications · 2K citations
25
h-index
TPDS · 22 publications · 1.9K citations
20
h-index
JSA · 14 publications · 545 citations
13
h-index
16 publications · 846 citations
13
h-index
FGCS · 13 publications · 451 citations
12
h-index
1–5