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)
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.inria.fr/hal-01248207
Contributor : Alain Monteil <>
Submitted on : Tuesday, March 22, 2016 - 8:42:49 AM
Last modification on : Wednesday, August 14, 2019 - 10:46:03 AM
Long-term archiving on : Sunday, November 13, 2016 - 10:11:48 PM

File

p168-krishna.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

289

Files downloads

66