Designing a commutative replicated data type - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Designing a commutative replicated data type


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.
Fichier principal
Vignette du fichier
RR-6320.pdf (352.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00177693 , version 1 (09-10-2007)
inria-00177693 , version 2 (10-10-2007)


  • 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⟩
529 View
3124 Download


Gmail Facebook Twitter LinkedIn More