Exploring the consistency problem space - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2005

Exploring the consistency problem space

Abstract

We study formally the consistency problem, for replicated shared data, in the Action-Constraint framework (ACF). ACF can describe a large range of application semantics and replication protocols, including optimistic and/or partial replication. ACF is used to decompose the consistency problem into simpler sub-problems. Each is easily understood. Existing algorithms from the literature can be explained as combinations of concrete sub-problem implementations. Using ACF, we design a new serialisation algorithm that does not cause aborts and only needs pairwise agreement (not global consensus)
Fichier principal
Vignette du fichier
p168-krishna.pdf (39.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01248207 , version 1 (22-03-2016)

Identifiers

Cite

Nishith Krishna, Marc Shapiro, Karthikeyan Bhargavan. Exploring the consistency problem space. 2005. ⟨hal-01248207⟩
145 View
80 Download

Altmetric

Share

Gmail Facebook X LinkedIn More