HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Combining algorithm-based fault tolerance and checkpointing for iterative solvers

Abstract : Several recent papers have introduced a periodic verification mechanism to detect silent errors in iterative solvers. Chen [PPoPP'13, pp. 167--176] has shown how to combine such a verification mechanism (a stability test checking the orthogonality of two vectors and recomputing the residual) with checkpointing: the idea is to verify every $d$ iterations, and to checkpoint every $c \times d$ iterations. When a silent error is detected by the verification mechanism, one can rollback to and re-execute from the last checkpoint. In this paper, we also propose to combine checkpointing and verification, but we use ABFT rather than stability tests. ABFT can be used for error detection, but also for error detection and correction, allowing a forward recovery (and no rollback nor re-execution) when a single error is detected. We present a performance model to compute the performance of all schemes, and we instantiate it using the Conjugate Gradient algorithm. Finally, we validate our new approach through a set of simulations.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, February 24, 2015 - 8:41:12 PM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Sunday, April 16, 2017 - 11:10:15 AM


Files produced by the author(s)


  • HAL Id : hal-01111707, version 2



Massimiliano Fasi, Yves Robert, Bora Uçar. Combining algorithm-based fault tolerance and checkpointing for iterative solvers. [Research Report] RR-8675, INRIA Grenoble - Rhône-Alpes; INRIA. 2015. ⟨hal-01111707v2⟩



Record views


Files downloads