Amortized Constant Round Atomic Snapshot in Message-Passing Systems

08/26/2020
by   Vijay Garg, et al.
0

We study the lattice agreement (LA) and atomic snapshot problems in asynchronous message-passing systems where up to f nodes may crash. Our main result is a crash-tolerant atomic snapshot algorithm with amortized constant round complexity. To the best of our knowledge, the best prior result is given by Delporte et al. [TPDS, 18] with amortized O(n) complexity if there are more scans than updates. Our algorithm achieves amortized constant round if there are Ω(√(k)) operations, where k is the number of actual failures in an execution and is bounded by f. Moreover, when there is no failure, our algorithm has O(1) round complexity unconditionally. To achieve amortized constant round complexity, we devise a simple early-stopping lattice agreement algorithm and use it to "order" the update and scan operations for our snapshot object. Our LA algorithm has O(√(k)) round complexity. It is the first early-stopping LA algorithm in asynchronous systems.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

07/30/2018

Lattice Agreement in Message Passing Systems

This paper studies the lattice agreement problem and the generalized lat...
03/17/2020

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

We present an algorithm for implementing a store-collect object in an as...
10/30/2020

Dynamic Distributed MIS with Improved Bounds

The problem of maintaining a maximal independent set (MIS) in a dynamic ...
11/25/2020

Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models

Message-passing models of distributed computing vary along numerous dime...
10/13/2019

Byzantine Generalized Lattice Agreement

The paper investigates the Lattice Agreement (LA) problem in asynchronou...
10/21/2019

Reconfigurable Lattice Agreement and Applications

Reconfiguration is one of the central mechanisms in distributed systems....
08/05/2020

The Athena Class of Risk-Limiting Ballot Polling Audits

The main risk-limiting ballot polling audit in use today, BRAVO, is desi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.