Reconfigurable Lattice Agreement and Applications
Reconfigurable Lattice Agreement and Applications
复制标题
可重构格协议和应用
DOI：
10.4230/lipics.opodis.2019.31
复制
发表时间：
2019
影响因子：
1.3
通讯作者：
S. Piergiovanni
中科院分区：
文献类型：
--
作者：
P. Kuznetsov;Thibault Rieutord;S. Piergiovanni
重构是分布式系统的核心机制之一。由于故障和连接中断，服务副本（或服务器）及其在计算中的角色可能必须随着时间的推移重新配置。为了向运行在这些服务器上的应用程序提供所需级别的一致性和可用性，服务的客户端应该能够就系统配置达成某种形式的协议。我们观察到，这种协议是自然捕获通过晶格偏序的系统状态。我们提出了一个异步实现的可重构格协议，这意味着优雅的可重构版本的一大类格抽象数据类型，如最大寄存器和冲突检测器，以及流行的分布式编程抽象，如原子快照和提交采用。
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.