Store-collect in the presence of continuous churn with application to snapshots and lattice agreement

Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Article number104869
JournalInformation and Computation
Volume285
DOIs
StatePublished - May 2022

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Store-collect in the presence of continuous churn with application to snapshots and lattice agreement'. Together they form a unique fingerprint.

Cite this