Fault-tolerant Computation Models

Fault-Tolerant Computation Models is a computational framework that belongs to the class of parallel computation models and is distinguished by its intrinsic ability to maintain correct operation and ensure algorithmic resilience in the presence of hardware or software faults through mechanisms such as redundancy, checkpointing, and error detection and recovery.

122

Publications

9K

Citations

296

Authors

156

Institutions

Publications per year

2017–2026

25

Authors

296

  1. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    5 publications · 99 citations

    5

    h-index

  2. GB
    George Bosilca

    University of Tennessee at Knoxville, United States

    4 publications · 89 citations

    4

    h-index

  3. WB
    Wesley Bland

    Argonne National Laboratory, United States

    3 publications · 73 citations

    3

    h-index

  4. TH
    Thomas Hérault

    University of Tennessee at Knoxville, United States

    3 publications · 69 citations

    3

    h-index

  5. MB
    Michael Ben-Or

    Hebrew University of Jerusalem, Israel

    3 publications · 684 citations

    3

    h-index

1–5 of 296

Venues

  1. Physical Review A

    PRA · 6 publications · 1.5K citations

    6

    h-index

  2. Physical Review Letters

    PRL · 6 publications · 579 citations

    6

    h-index

  3. IEEE Transactions on Computers

    5 publications · 286 citations

    5

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 37 citations

    3

    h-index

  5. Physical review. B./Physical review. B

    PRB · 2 publications · 26 citations

    2

    h-index

1–5