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.

中文翻译：

---

Store-Collect 在连续流失的情况下应用于快照和 Lattice 协议

我们提出了一种算法，用于在异步崩溃的消息传递动态系统中实现 store-collect 对象，其中节点不断进入和离开。该算法非常简单高效，一次存储操作只需要一次往返，一次收集只需要两次。然后我们展示了 store-collect 对象的多功能性，用于实现有用数据结构的容错版本，同时保护用户免受底层流失的复杂性。特别是，我们展示了使用 store-collect 的原子快照和广义格协议对象的优雅和高效实现。