DeepAI AI Chat
Log In Sign Up

Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement

by   Hagit Attiya, et al.

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. The store-collect object is not linearizable and can easily be used to implement several non-linearizable objects. Yet without much additional effort, it can also be used to implement atomic snapshot and generalized lattice agreement objects, which are linearizable. Thus the store-collect sits in a sweet spot combining algorithmic flexibility and efficiency.


page 1

page 2

page 3

page 4


Amortized Constant Round Atomic Snapshot in Message-Passing Systems

We study the lattice agreement (LA) and atomic snapshot problems in asyn...

Lattice Agreement in Message Passing Systems

This paper studies the lattice agreement problem and the generalized lat...

Linearizable Replicated State Machines with Lattice Agreement

This paper studies the lattice agreement problem in asynchronous systems...

Optimally Hiding Object Sizes with Constrained Padding

Among the most challenging traffic-analysis attacks to confound are thos...

Accountability and Reconfiguration: Self-Healing Lattice Agreement

An accountable distributed system provides means to detect deviations of...

Reconfigurable Lattice Agreement and Applications

Reconfiguration is one of the central mechanisms in distributed systems....