Exploring the power of shared memory communication objects and models, and the limits of
distributed computability are among the most exciting research areas of distributed …

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 …

In the set agreement problem, n processes have to decide on at most n-1 of the proposed
values. This paper shows that the anti-Omega failure detector is both sufficient and …

Many problems in distributed computing are impossible when no information about process
failures is available. It is common to ask what information about failures is necessary and …

Asynchronous failure detector-based set agreement algorithms proposed so far assume that
all the processes participate in the algorithm. This means that (at least) the processes that do …

The wait-free read-write memory model has been characterized as an iterated\emph
{Immediate Snapshot}(IS) task. The IS task is\emph {affine}---it can be defined as a (sub) set …

The adaptive M-renaming problem consists of providing processes with a new name taken
from a name space whose size M depends only on the number p of processes that …

Processes in a concurrent system need to coordinate using an underlying shared memory or
a message-passing system in order to solve agreement tasks such as, for example …

An important issue in fault-tolerant asynchronous computing is the respective power of an
object type with respect to another object type. This question has received a lot of attention …

In the wait-free shared memory model substantial attention has been devoted to
understanding the relative power of sub-consensus tasks. Two important sub-consensus …