Agreement on the membership of a group of processes in a distributed system is a basic
problem that arises in a wide range of applications. Such groups occur when a set of processes …

The thesis formally defines the class of Process Group Membership Problems (GMP) for
asynchronous systems. These problems involve maintaining a list of processes belonging to the …

Failure detectors (or, more accurately, failure suspectors, or FS) appear to be a fundamental
service upon which to build fault-tolerant, distributed applications. It is shown that an FS with …

Discusses partitions in asynchronous message-passing systems. In such systems, slow
processes and slow links can lead to virtual partitions that are indistinguishable from real ones. …

The Group Membership Problem is concered with propagating changes in the membership
of a group of processes to the members of that group. A restricted version of this problem …

The development of reliable distributed software is simplified by the ability to assume a fail-stop
failure model. We discuss the emulation of such a model in an asynchronous distributed …

This paper derives necessary and sufficient communication for distributed applications that
perform certain actions uniformly in asynchronous systems. We show there is an essential …

There are similarities between problems associated with processes that are under the control
of an intruder and problems associated with processes that are arbitrarily faulty. A process …

The CLEO project [2], centered at Cornell University, is a large-scale high energy physics
project. The goals of the project arise from an esoteric question---why is there apparently so …

Introduction The overwhelming body of literature in coordination and agreement problems
discusses the issues in reaching a single distributed decision, or when multiple decisions …