What can and cannot be computed in a distributed system is a complex function of the
system's communication model, timing model, and failure model. Considering a canonical …

The notion of a universal construction is central in computing science: the wheel has not to
be reinvented for each new problem. In the context of n-process asynchronous distributed …

Abortable mutual exclusion is a variant of mutual exclusion, where processes are allowed to
abort their invocations while waiting to enter the critical section. In this paper, we present an …

Understanding the effect of different progress conditions on the computability of distributed
systems is an important and exciting research direction. For a system with n processes, we …

A liveness contract is an agreement between the specifier of a system and a task to solve,
and the programmer who makes her living by delivering protocols. In a shared-memory …

We study distributed algorithms that solve agreement problems, namely, k-set agreement.
Their purpose is to compute and irrevocably set the output yp of process p to some decision …

This paper is an algorithmic introduction to anonymity in asynchronous systems where
processes communicate by reading and writing atomic read/write registers. Two types of …

In 1926, Gilbert Keith Chesterton published a novel “The Return of Don Quixote” that
reflected the advancing industrialization of the Western world, where mass production …

Traditionally, models of fault-tolerant distributed computing assume that failures are
“uniform”: processes are equally probable to fail and a failure of one process does not affect …

The history of distributed computing is full of trade-offs between safety and liveness. For
instance, one of the most celebrated results in the field, namely the impossibility of …