Causal-Consistent Reversibility in a Tuple-Based Language

Abstract : Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal-consistent reversibility in the context of µKLAIM, a formal coordination language based on distributed tuple spaces. We consider both uncontrolled reversibility, suitable to study the basic properties of the reversibility mechanism, and controlled reversibility based on a rollback operator, more suitable for programming applications. The causality structure of the language, and thus the definition of its reversible semantics, differs from all the reversible languages in the literature because of its generative communication paradigm. In particular, the reversible behavior of µKLAIM read primitive, reading a tuple without consuming it, cannot be matched using channel-based communication. We illustrate the reversible extensions of µKLAIM on a simple, but realistic, application scenario.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01227615
Contributor : Ivan Lanese <>
Submitted on : Monday, November 16, 2015 - 11:17:01 PM
Last modification on : Wednesday, October 10, 2018 - 10:09:14 AM
Long-term archiving on : Friday, April 28, 2017 - 5:29:08 AM

File

pdp.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Elena Giachino, Ivan Lanese, Claudio Antares Mezzina, Francesco Tiezzi. Causal-Consistent Reversibility in a Tuple-Based Language. PDP 2015 - 23rd Euromicro International Conference on Parallel, Distributed and Network-Based Processing, Mar 2015, Turku, Finland. pp.467 - 475, ⟨10.1109/PDP.2015.98⟩. ⟨hal-01227615⟩

Share

Metrics

Record views

251

Files downloads

176