Checkpoint/rollback vs causally-consistent reversibility - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Checkpoint/rollback vs causally-consistent reversibility

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
RC2018Final.pdf (375.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01953756 , version 1 (13-12-2018)

Identifiers

Cite

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⟩
102 View
177 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More