Distributed consensus is a fundamental primitive for constructing fault-tolerant, strongly-
consistent distributed systems. Though many distributed consensus algorithms have been …

The Paxos algorithm, despite being synonymous with distributed consensus for a decade, is
famously difficult to reason about and implement due to its non-intuitive approach and …

The paper addresses the cost of consensus algorithms. It has been shown that in the best
case, consensus can be solved in two communication steps with f< n/2, and in one …

Abstract We introduce Egalitarian Paxos, a new distributed consensus algorithm that
achieves three goals:(1) optimal commit latency in the wide-area when tolerating one and …

In the consensus problem, processes must agree on a single value, given a set of proposals.
It is used, for example, to implement statemachine replication [4], in which failure …

Distributed consensus is integral to modern distributed systems. The widely adopted Paxos
algorithm uses two phases, each requiring majority agreement, to reliably reach consensus …

Distributed consensus is fundamental to building fault-tolerant systems. It allows a collection
of machines to work as a coherent group that can survive the failures of some of its …

We study the implication that various timeliness and failure detector assumptions have on
the performance of consensus algorithms that exploit them. We present a general …

The Paxos algorithm for implementing a fault-tolerant distributed system has been regarded
as difficult to understand, perhaps because the original presentation was Greek to many …

The Paxos algorithm is famously difficult to reason about and even more so to implement,
despite having been synonymous with distributed consensus for over a decade. The …