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.
Type de document :
Communication dans un congrès
RC 2018 - 10th International Conference on Reversible Computation, Sep 2018, Leicester, United Kingdom. Springer, 11106, pp.286-303, 2018, Lecture Notes in Computer Science. 〈10.1007/978-3-319-99498-7_20〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01953756
Contributeur : Jean-Bernard Stefani <>
Soumis le : jeudi 13 décembre 2018 - 11:28:04
Dernière modification le : jeudi 7 février 2019 - 15:37:54

Fichier

RC2018Final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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. Springer, 11106, pp.286-303, 2018, Lecture Notes in Computer Science. 〈10.1007/978-3-319-99498-7_20〉. 〈hal-01953756〉

Partager

Métriques

Consultations de la notice

48

Téléchargements de fichiers

25