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 …

Byzantine agreement requires a set of parties in a distributed system to agree on a value
even if some parties are corrupted. A new protocol for Byzantine agreement in a completely …

We present the first protocol that reaches asynchronous Byzantine consensus in two
communication steps in the common case. We prove that our protocol is optimal in terms of …

We consider the problem of making apps fault-tolerant through replication, when apps
operate at the microsecond scale, as in finance, embedded computing, and microservices …

We present an algorithm, called Disk Paxos, for implementing a reliable distributed system
with a network of processors and disks. Like the original Paxos algorithm, Disk Paxos …

To solve consensus, distributed systems have to be equipped with oracles such as a failure
detector, a leader capability, or a random number generator. For each oracle, various …

The evolution of distributed computing and applications has put new challenges on models,
architectures and systems. To name just one,'reconciling uncertainty with predictability'is …

Asynchronous Byzantine consensus algorithms are an important primitive for building
Byzantine fault-tolerant systems. Algorithms for Byzantine consensus typically require at …

Abstract We present Byzantine Disk Paxos, an asynchronous shared-memory consensus
algorithm that uses a collection of n< 3 t disks, t of which may fail by becoming non …

Remote Direct Memory Access (RDMA) is becoming widely available in data centers. This
technology allows a process to directly read and write the memory of a remote host, with a …