Asynchronous rebalancing of a replicated tree - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Asynchronous rebalancing of a replicated tree


We study the problem of rebalancing a replicated tree, while the tree is concurrently being updated in a P2P manner. Tree updates are asynchronous and commutative, as we aim at eventual consistency. However, rebalancing requires strong synchronisation, because only replicas that have performed the same rebalances can communicate with one another. In order to scale to large networks, we propose to break this synchronisation into two parts: commitment within a small core of replicas, followed by asynchronous, pairwise catch-up protocol between replicas at different rebalance numbers. We state the requirements and correctness conditions for this distributed algorithm, and propose a correct solution. Keywords: replicated tree, collaborative editing, garbage collection, distributed systems
Fichier principal
Vignette du fichier
Asynch%20rebalancing%20of%20a%20replicated%20tree%20Zawirski-CFSE-2011.pdf (328.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01248197 , version 1 (24-12-2015)


  • HAL Id : hal-01248197 , version 1


Marek Zawirski, Marc Shapiro, Nuno Preguiça. Asynchronous rebalancing of a replicated tree. Conférence Française en Systèmes d'Exploitation (CFSE), May 2011, Saint-Malo, France. pp.12. ⟨hal-01248197⟩
217 View
75 Download


Gmail Facebook X LinkedIn More