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
Type de document :
Communication dans un congrès
PODC 2005 - 24th annual ACM symposium on Principles Of Distributed Computing, Jul 2005, Las Vegas, Nevada, United States. ACM, pp.168--168, 2005, 〈10.1145/1073814.1073845〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01248206
Contributeur : Alain Monteil <>
Soumis le : jeudi 24 décembre 2015 - 09:43:11
Dernière modification le : vendredi 31 août 2018 - 09:25:54

Identifiants

Collections

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. ACM, pp.168--168, 2005, 〈10.1145/1073814.1073845〉. 〈hal-01248206〉

Partager

Métriques

Consultations de la notice

143