Causal-Consistent Reversibility in a Tuple-Based Language - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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

Dates and versions

hal-01227615 , version 1 (16-11-2015)

Identifiers

Cite

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⟩
123 View
86 Download

Altmetric

Share

Gmail Facebook X LinkedIn More