Fault-tolerant Message-passing Algorithms
Fault-Tolerant Message-Passing Algorithms is a class of distributed algorithms designed to maintain correct and coherent communication among processing nodes in a parallel computing system despite the occurrence of faults, by incorporating mechanisms for error detection, recovery, and message reliability within the message-passing paradigm.
14
Publications
627
Citations
49
Authors
21
Institutions
Publications per year
2017–2026
1
14
PVM and MPI: a Comparison of Features
G.A. Geist, J.A. Kohl, Philip M. Papadopoulos · 2007 · 107 citations
MPI-FT: PORTABLE FAULT TOLERANCE SCHEME FOR MPI
Soulla P. Louca, Neophytos Neophytou, Adrianos Lachanas et al. · Parallel Processing Letters · 2000 · 78 citations
1–5 of 14
49
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 49
21

Universidade da Coruña
A Coruña, Spain
1 h-index
4 publications
72 citations

University of Salerno
Fisciano, Italy
1 h-index
1 publications
67 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
13 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
1 h-index
3 publications
63 citations
Arizona State University
Tempe, United States
1 h-index
1 publications
38 citations
University of California, Irvine
Irvine, United States
1 h-index
1 publications
13 citations
Los Alamos National Laboratory
Los Alamos, United States
1 h-index
1 publications
15 citations
University of Tennessee at Knoxville
Knoxville, United States
1 h-index
3 publications
120 citations
1–8 of 21
2 publications · 146 citations
2
h-index
1 publications · 40 citations
1
h-index
JACM · 1 publications · 38 citations
1
h-index
1 publications · 78 citations
1
h-index
1 publications · 27 citations
1
h-index
1–5