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)
Type de document :
Pré-publication, Document de travail
Submitted PODC 2005. 2005
Liste complète des métadonnées

https://hal.inria.fr/hal-01248207
Contributeur : Alain Monteil <>
Soumis le : mardi 22 mars 2016 - 08:42:49
Dernière modification le : mardi 17 avril 2018 - 11:35:00
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 22:11:48

Fichier

p168-krishna.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Nishith Krishna, Marc Shapiro, Karthikeyan Bhargavan. Exploring the consistency problem space. Submitted PODC 2005. 2005. 〈hal-01248207〉

Partager

Métriques

Consultations de la notice

231

Téléchargements de fichiers

32