Skip to Main content Skip to Navigation

On the Combination of Silent Error Detection and Checkpointing

Abstract : In this paper, we revisit traditional checkpointing and rollback recovery strategies, with a focus on silent data corruption errors. Contrarily to fail-stop failures, such latent errors cannot be detected immediately, and a mechanism to detect them must be provided. We consider two models: (i) errors are detected after some delays following a probability distribution (typically, an Exponential distribution); (ii) errors are detected through some verification mechanism. In both cases, we compute the optimal period in order to minimize the waste, i.e., the fraction of time where nodes do not perform useful computations. In practice, only a fixed number of checkpoints can be kept in memory, and the first model may lead to an irrecoverable failure. In this case, we compute the minimum period required for an acceptable risk. For the second model, there is no risk of irrecoverable failure, owing to the verification mechanism, but the corresponding overhead is included in the waste. Finally, both models are instantiated using realistic scenarios and application/architecture parameters.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Guillaume Pallez (Aupy) Connect in order to contact the contributor
Submitted on : Friday, June 21, 2013 - 4:05:02 PM
Last modification on : Friday, September 30, 2022 - 4:12:04 AM
Long-term archiving on: : Wednesday, April 5, 2017 - 1:43:42 AM


Files produced by the author(s)


  • HAL Id : hal-00836871, version 1


Guillaume Aupy, Anne Benoit, Thomas Herault, Yves Robert, Frédéric Vivien, et al.. On the Combination of Silent Error Detection and Checkpointing. [Research Report] RR-8319, INRIA. 2013. ⟨hal-00836871⟩



Record views


Files downloads