Recoverable Consensus in Shared Memory

04/27/2018
by   Wojciech Golab, et al.
0

Herlihy's consensus hierarchy is one of the most widely cited results in distributed computing theory. It ranks the power of various synchronization primitives for solving consensus in a model where asynchronous processes communicate through shared memory and fail by halting. This paper revisits the consensus hierarchy in a model with crash-recovery failures, where the specification of consensus, called recoverable consensus in this paper, is weakened by allowing non-terminating executions when a process fails infinitely often. Two variations of this model are considered: independent failures, and simultaneous (i.e., system-wide) failures. Universal primitives such as Compare-And-Swap solve consensus easily in both models, and so the contributions of the paper focus on lower levels of the hierarchy. We make three contributions in that regard: (i) We prove that any primitive at level two of Herlihy's hierarchy remains at level two if simultaneous crash-recovery failures are introduced. This is accomplished by transforming (one instance of) any 2-process conventional consensus algorithm to a 2-process recoverable consensus algorithm. (ii) For any n > 1 and f > 0, we show how to use f+1 instances of any conventional n-process consensus algorithm and Θ(f + n) read/write registers to solve n-process recoverable consensus when crash-recovery failures are independent, assuming that every execution contains at most f such failures. (iii) Lastly, we prove for any f > 0 that any 2-process recoverable consensus algorithm that uses TAS and read/writer registers requires at least f+1 TAS objects, assuming that crash-recovery failures are independent and every execution contains at most f such failures per process (or at most 2f failures total).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2022

When Is Recoverable Consensus Harder Than Consensus?

We study the ability of different shared object types to solve recoverab...
research
09/20/2023

Better Sooner Rather Than Later

This article unifies and generalizes fundamental results related to n-pr...
research
10/21/2017

Seamless Paxos Coordinators

The Paxos algorithm requires a single correct coordinator process to ope...
research
02/02/2018

A Simple Object that Spans the Whole Consensus Hierarchy

This paper presents a simple generalization of the basic atomic read/wri...
research
05/29/2019

The Impact of RDMA on Agreement

Remote Direct Memory Access (RDMA) is becoming widely available in data ...
research
09/19/2022

Rapid Recovery of Program Execution Under Power Failures for Embedded Systems with NVM

After power is switched on, recovering the interrupted program from the ...
research
02/12/2018

Is Compare-and-Swap Really Necessary?

The consensus number of a synchronization primitive, such as compare-and...

Please sign up or login with your details

Forgot password? Click here to reset