Causal-consistent rollback in a tuple-based language - Archive ouverte HAL Access content directly
Journal Articles Journal of Logical and Algebraic Methods in Programming Year : 2017

Causal-consistent rollback in a tuple-based language

(1) , (1) , (2, 3) , (4)
1
2
3
4

Abstract

Rollback is a fundamental technique for ensuring reliability of systems, allowing one, in case of troubles, to recover a past system state. However, the definition of rollback in a concurrent/distributed scenario is quite tricky. We propose an approach based on the notion of causal-consistent reversibility: any given past action can be undone, provided that all the actions caused by it are undone as well. Given that, we define a rollback as the minimal causal-consistent sequence of backward steps able to undo a given action. We define the semantics of such a rollback operator, and show that it satisfies the above specification. The approach that we present is quite general, but we instantiate it in the case of µKlaim, a formal coordination language based on distributed tuple spaces. We remark that this is the first definition of causal-consistent rollback in a shared-memory setting. We illustrate the use of rollback in µKlaim on a simple, but realistic, application scenario.
Fichier principal
Vignette du fichier
main.pdf (455.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01633260 , version 1 (12-11-2017)

Identifiers

Cite

Elena Giachino, Ivan Lanese, Claudio Antares Mezzina, Francesco Tiezzi. Causal-consistent rollback in a tuple-based language. Journal of Logical and Algebraic Methods in Programming, 2017, 88, pp.99 - 120. ⟨10.1016/j.jlamp.2016.09.003⟩. ⟨hal-01633260⟩
279 View
112 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More