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

Authors

552

  1. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    12 publications · 717 citations

    11

    h-index

  2. GB
    George Bosilca

    University of Tennessee at Knoxville, United States

    9 publications · 607 citations

    9

    h-index

  3. JS
    James S. Plank

    University of Tennessee at Knoxville, United States

    6 publications · 280 citations

    6

    h-index

  4. ZC
    Zizhong Chen

    University of California, Riverside, United States

    5 publications · 347 citations

    5

    h-index

  5. AB
    Aurélien Bouteiller

    University of Tennessee at Knoxville, United States

    5 publications · 278 citations

    5

    h-index

1–5 of 552

Venues

  1. IEEE Transactions on Computers

    13 publications · 470 citations

    12

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 9 publications · 558 citations

    9

    h-index

  3. Information Processing Letters

    8 publications · 401 citations

    8

    h-index

  4. Journal of Parallel and Distributed Computing

    7 publications · 345 citations

    7

    h-index

  5. Information Sciences

    7 publications · 250 citations

    7

    h-index

1–5