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

Authors

49

  1. ER
    Eric Rodriguez

    University of Pittsburgh, United States

    1 publications · 46 citations

    1

    h-index

  2. NN
    Neophytos Neophytou

    University of Warwick, United Kingdom

    1 publications · 78 citations

    1

    h-index

  3. AL
    Adrianos Lachanas

    University of Cyprus, Cyprus

    1 publications · 78 citations

    1

    h-index

  4. AK
    Ambuj K. Singh

    University of California, Santa Barbara, United States

    1 publications · 14 citations

    1

    h-index

  5. GB
    George Bosilca

    University of Tennessee at Knoxville, United States

    1 publications · 40 citations

    1

    h-index

1–5 of 49

Venues

  1. 2

    h-index

  2. 1

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 38 citations

    1

    h-index

  4. Parallel Processing Letters

    1 publications · 78 citations

    1

    h-index

  5. SIAM Journal on Computing

    1 publications · 27 citations

    1

    h-index

1–5