Brief announcement: 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).
Keywords : rep
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01248206
Contributor : Alain Monteil <>
Submitted on : Thursday, December 24, 2015 - 9:43:11 AM
Last modification on : Wednesday, August 14, 2019 - 10:46:03 AM

Identifiers

Citation

Nishith Krishna, Marc Shapiro, Karthikeyan Bhargavan. Brief announcement: Exploring the Consistency Problem Space. PODC 2005 - 24th annual ACM symposium on Principles Of Distributed Computing, Jul 2005, Las Vegas, Nevada, United States. pp.168--168, ⟨10.1145/1073814.1073845⟩. ⟨hal-01248206⟩

Share

Metrics

Record views

168