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: Chapter in Book/Report/Conference proceedingConference contributionpeer-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
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Proceedings
EditorsStéphane Devismes, Neeraj Mittal
PublisherSpringer Science and Business Media Deutschland GmbH
Pages1-15
Number of pages15
ISBN (Print)9783030643478
DOIs
StatePublished - 2020
Event22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020 - Austin, United States
Duration: 18 Nov 202021 Nov 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12514 LNCS

Conference

Conference22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020
Country/TerritoryUnited States
CityAustin
Period18/11/2021/11/20

Keywords

  • Atomic snapshots
  • Churn
  • Crash resilience
  • Dynamic message-passing systems
  • Generalized lattice agreement
  • Store-collect object

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Cite this