Efficient renaming in CRDTs - Archive ouverte HAL Access content directly
Conference Papers Year :

Efficient renaming in CRDTs

(1)
1

Abstract

Sequence Conflict-free Replicated Data Types (CRDTs) allow to repli-cate and edit, without any kind of coordination, sequences in distributed systems. To ensure convergence, existing works from the literature add metadata to each element but they do not bound its footprint, which impedes their adoption. Several approaches were proposed to address this issue but they do not fit a fully distributed setting. In this paper, we present our ongoing work on the design and validation of a fully distributed renaming mechanism, setting a bound to the metadata's footprint. Addressing this issue opens new perspectives of adoption of these CRDTs in distributed applications.
Fichier principal
Vignette du fichier
position-paper.pdf (324.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01932552 , version 1 (23-11-2018)

Identifiers

  • HAL Id : hal-01932552 , version 1

Cite

Matthieu Nicolas. Efficient renaming in CRDTs. Middleware 2018 - 19th ACM/IFIP International Middleware Conference (Doctoral Symposium), Dec 2018, Rennes, France. ⟨hal-01932552⟩
116 View
75 Download

Share

Gmail Facebook Twitter LinkedIn More