Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
复制标题
在存在连续搅动的情况下存储-收集，并应用于快照和网格协议
DOI：
10.1016/j.ic.2022.104869
复制
发表时间：
2022
影响因子：
1
通讯作者：
Welch, Jennifer L.
中科院分区：
文献类型：
--
作者：
Attiya, Hagit;Kumari, Sweta;Somani, Archit;Welch, Jennifer L.
我们提出了一种在异步、容易崩溃的消息传递动态系统中实现存储-收集对象的算法，其中节点不断进入和离开。该算法非常简单且高效，存储操作只需一次往返，收集操作只需两次。然后，我们展示了存储-收集对象的多功能性，用于实现有用数据结构的搅动容忍版本，同时保护用户免受底层搅动的复杂性的影响。特别是，我们提出了使用存储收集的原子快照和广义格协议对象的优雅且高效的实现。
We present an algorithm for implementing a store-collect object in an asynchronous crash-prone message-passing dynamic system, where nodes continually enter and leave. The algorithm is very simple and efficient, requiring just one round trip for a store operation and two for a collect. We then show the versatility of the store-collect object for implementing churn-tolerant versions of useful data structures, while shielding the user from the complications of the underlying churn. In particular, we present elegant and efficient implementations of atomic snapshot and generalized lattice agreement objects that use store-collect.