Causal-consistent rollback in a tuple-based language

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.
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/hal-01633260
Contributor : Ivan Lanese <>
Submitted on : Sunday, November 12, 2017 - 9:11:22 AM
Last modification on : Wednesday, October 10, 2018 - 10:09:53 AM
Long-term archiving on : Tuesday, February 13, 2018 - 12:49:25 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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, Elsevier, 2017, 88, pp.99 - 120. ⟨10.1016/j.jlamp.2016.09.003⟩. ⟨hal-01633260⟩

Share

Metrics

Record views

338

Files downloads

128