inria-00177693, version 2
Designing a commutative replicated data type
Marc Shapiro
a, 1Nuno Preguiça b, 2
N° RR-6320 (2007)
Résumé : Commuting operations greatly simplify consistency in distributed systems. This paper focuses on designing for commutativity, a topic neglected previously. We show that the replicas of any data type for which concurrent operations commute converges to a correct value, under some simple and standard assumptions. We also show that such a data type supports transactions with very low cost. We identify a number of approaches and techniques to ensure commutativity. We re-use some existing ideas (non-destructive updates coupled with invariant identification), but propose a much more efficient implementation. Furthermore, we propose a new technique, background consensus. We illustrate these ideas with a shared edit buffer data type.
- a – INRIA
- b – FCT - Universidade Nova de Lisboa, Portugal
- 1 : REGAL (INRIA Rocquencourt)
- INRIA – CNRS : UMR7606 – Université Paris VI - Pierre et Marie Curie
- 2 : Centro de Investigação em Informática e Tecnologias da Informação (CITI)
- Universidade Nova de Lisboa
- Domaine : Informatique/Informatique et langage
Informatique/Calcul parallèle, distribué et partagéInformatique/Algorithme et structure de données - Mots-clés : Data replication – optimistic replication – commutative operations
- Référence interne : RR-6320
- Versions disponibles : v1 (09-10-2007) v2 (10-10-2007)
- inria-00177693, version 2
- http://hal.inria.fr/inria-00177693
- oai:hal.inria.fr:inria-00177693
- Contributeur : Rapport De Recherche Inria
- Soumis le : Mercredi 10 Octobre 2007, 09:02:08
- Dernière modification le : Mercredi 10 Octobre 2007, 09:02:31
Documents associés
Exporter