Relaxed Paxos: Quorum Intersection Revisited (Again)

03/06/2022
by   Heidi Howard, et al.
0

Distributed consensus, the ability to reach agreement in the face of failures, is a fundamental primitive for constructing reliable distributed systems. The Paxos algorithm is synonymous with consensus and widely utilized in production. Paxos uses two phases: phase one and phase two, each requiring a quorum of acceptors, to reach consensus during a round of the protocol. Traditionally, Paxos requires that all quorums, regardless of phase or round, intersect and majorities are often used for this purpose. Flexible Paxos proved that it is only necessary for phase one quorum of a given round to intersect with the phase two quorums of all previous rounds. In this paper, we re-examine how Paxos approaches the problem of consensus. We look again at quorum intersection in Flexible Paxos and observe that quorum intersection can be safely weakened further. Most notably, we observe that if a proposer learns that a value was proposed in some previous round then its phase one no longer needs to intersect with the phase two quorums from that round or from any previous rounds. Furthermore, in order to provide an intuitive explanation of our results, we propose a novel abstraction for reasoning about Paxos which utilizes write-once registers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2019

A Generalised Solution to Distributed Consensus

Distributed consensus, the ability to reach agreement in the face of fai...
research
08/06/2020

Fast Flexible Paxos: Relaxing Quorum Intersection for Fast Paxos

Paxos, the de facto standard approach to solving distributed consensus, ...
research
05/02/2018

Breaking the (√(n)) Barrier: Fast Consensus under a Late Adversary

We study the consensus problem in a synchronous distributed system of n ...
research
11/20/2017

Schlegel Diagram and Optimizable Immediate Snapshot Protocol

In the topological study of distributed systems, the immediate snapshot ...
research
10/23/2017

On the Coordinator's Rule for Fast Paxos

Fast Paxos is an algorithm for consensus that works by a succession of r...
research
04/25/2022

Parameterized safety verification of round-based shared-memory systems

We consider the parameterized verification problem for distributed algor...

Please sign up or login with your details

Forgot password? Click here to reset