Fault-tolerant Parallel Algorithms
Fault-Tolerant Parallel Algorithms is a class of parallel algorithms designed to maintain correct operation and achieve desired computational outcomes despite the occurrence of faults or failures in processing elements or communication channels during execution.
218
Publications
9.3K
Citations
552
Authors
234
Institutions
Publications per year
2017–2026
22
Parents
Children
Adaptive Fault ToleranceAsynchronous Parallel AlgorithmsCheckpointingCommunication-avoiding AlgorithmsConsensus Under FaultsDeterministic Parallel AlgorithmsDistributed Snapshot AlgorithmsFault-tolerant Collective CommunicationFault-tolerant Computation ModelsFault-tolerant Load Distribution
218
Yucheng Low, Danny Bickson, Joseph E. Gonzalez et al. · Proceedings of the VLDB Endowment · 2012 · 1.7K citations
1–5 of 218
552
11
h-index
9
h-index
6
h-index
5
h-index
University of Tennessee at Knoxville, United States
5 publications · 278 citations
5
h-index
1–5 of 552
234
University of Tennessee at Knoxville
Knoxville, United States
12 h-index
37 publications
2.4K citations

Oak Ridge National Laboratory
Oak Ridge, United States
10 h-index
18 publications
382 citations
The University of Texas at Austin
Austin, United States
7 h-index
12 publications
304 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
10 publications
612 citations
Princeton University
Princeton, United States
6 h-index
9 publications
504 citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
16 publications
870 citations

Lawrence Livermore National Laboratory
Livermore, United States
6 h-index
18 publications
863 citations

Australian National University
Canberra, Australia
5 h-index
21 publications
345 citations
1–8 of 234
13 publications · 470 citations
12
h-index
TPDS · 9 publications · 558 citations
9
h-index
8 publications · 401 citations
8
h-index
7 publications · 345 citations
7
h-index
7 publications · 250 citations
7
h-index
1–5