Checkpoint/rollback vs causally-consistent reversibility

Martin Vassor 1 Jean-Bernard Stefani 1
1 SPADES - Sound Programming of Adaptive Dependable Embedded Systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : This paper analyzes the relationship between a distributed checkpoint/rollback scheme based on causal logging, called Manetho, and a reversible concurrent model of computation, based on the π-calculus with imperative rollback developed by Lanese et al. in [?]. We show a rather tight relationship between rollback based on causal logging as performed in Manetho and the rollback algorithm underlying the calculus in [?]. Our main result is that the latter can faithfully simulate Manetho, where the notion of simulation we use is that of weak barbed simulation, and that the converse only holds if possible rollbacks in are restricted.
Complete list of metadatas

https://hal.inria.fr/hal-01953756
Contributor : Jean-Bernard Stefani <>
Submitted on : Thursday, December 13, 2018 - 11:28:04 AM
Last modification on : Thursday, February 7, 2019 - 3:37:54 PM
Long-term archiving on : Thursday, March 14, 2019 - 1:45:43 PM

File

RC2018Final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Martin Vassor, Jean-Bernard Stefani. Checkpoint/rollback vs causally-consistent reversibility. RC 2018 - 10th International Conference on Reversible Computation, Sep 2018, Leicester, United Kingdom. pp.286-303, ⟨10.1007/978-3-319-99498-7_20⟩. ⟨hal-01953756⟩

Share

Metrics

Record views

93

Files downloads

106