Reconfigurable Lattice Agreement and Applications - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2019

Reconfigurable Lattice Agreement and Applications

(1, 2) , (3) , (3)
1
2
3

Abstract

Reconfiguration is one of the central mechanisms in distributed systems. Due to failures and connectivity disruptions, the very set of service replicas (or $servers$) and their roles in the computation may have to be reconfigured over time. To provide the desired level of consistency and availability to applications running on top of these servers, the $clients$ of the service should be able to reach some form of agreement on the system configuration. We observe that this agreement is naturally captured via a $lattice$ partial order on the system states. We propose an asynchronous implementation of $reconfigurable$ lattice agreement that implies elegant reconfigurable versions of a large class of $lattice$ abstract data types, such as max-registers and conflict detectors, as well as popular distributed programming abstractions, such as atomic snapshot and commit-adopt.
Fichier principal
Vignette du fichier
RLA2019.pdf (568.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-02321547 , version 1 (21-10-2019)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Petr Kuznetsov, Thibault Rieutord, Sara Tucci-Piergiovanni. Reconfigurable Lattice Agreement and Applications. [Research Report] Institut Polytechnique Paris; CEA List. 2019. ⟨cea-02321547⟩
256 View
202 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More