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
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 10 octobre 2007 - 09:02:08
Dernière modification le : lundi 29 mai 2017 - 14:21:48
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 17:55:42


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00177693, version 2



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



Consultations de
la notice


Téléchargements du document