Designing a commutative replicated data type

Abstract : 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.
Liste complète des métadonnées

https://hal.inria.fr/inria-00177693
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 10 octobre 2007 - 09:02:08
Dernière modification le : vendredi 16 septembre 2016 - 15:19:26
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 17:55:42

Fichier

RR-6320.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00177693, version 2

Collections

Citation

Marc Shapiro, Nuno Preguiça. Designing a commutative replicated data type. [Research Report] RR-6320, INRIA. 2007. <inria-00177693v2>

Partager

Métriques

Consultations de
la notice

378

Téléchargements du document

937