Fault tolerance in distributed computing is a wide area with a significant body of literature
that is vastly diverse in methodology and terminology. This paper aims at structuring the …

A failure detector is a fundamental abstraction in distributed computing. This article surveys
this abstraction through two dimensions. First we study failure detectors as building blocks to …

We study the problems of failure detection and consensus in asynchronous systems in
which processes may crash and recover, and links may lose messages. We first propose …

It is now well recognized that consensus is a fundamental problem one has to solve to
implement reliable applications on top of unreliable asynchronous distributed systems prone …

This paper describes a modular approach for the construction of fault-tolerant agreement
protocols. The approach is based on a generic consensus service. Fault-tolerant agreement …

By a data conflict in a distributed system we understand a situation (or a state of the system)
in which the system sites generate and store different versions of data which represent the …

We study the problems of failure detection and consensus in asynchronous systems in
which processes may crash and recover, and links may lose messages. We first propose …

It is now recognized that the Consensus problem is a fundamental problem when one has to
design and implement reliable asynchronous distributed systems. This chapter is on the …

While Total Order Broadcast (or Atomic Broadcast) primitives have received a lot of attention,
the paper concentrates on Total Order Multicast to Multiple Groups in the context of …

We study the problem of achieving reliable communication with quiescent algorithms (ie,
algorithms that eventually stop sending messages) in asynchronous systems with process …