The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to
solve the consensus problem in a natural model of an asynchronous distributed system if …

Shared-memory mutual exclusion: major research trends since 1986 Page 1 Digital Object
Identifier (DOI) 10.1007/s00446-003-0088-6 Distrib. Comput. (2003) 16: 75–110 c Springer-Verlag …

We survey results from distributed computing that show tasks to be impossible, either
outright or within given resource bounds, in various models. The parameters of the models …

Mutual exclusion (mutex) is one of the most fundamental synchronization problems
encountered in shared memory systems. It appears in all computer science first-degree …

Fairness is a mathematical abstraction: in a multiprogramming environment, fairness
abstracts the details of admissible (“fair”) schedulers; in a distributed environment, fairness …

We examine a class of collective coin-flip** games that arises from randomized distributed
algorithms with halting failures. In these games, a sequence of local coin flips is generated …

The obstruction-free progress condition is weaker than previous nonblocking progress
conditions such as lock-freedom and wait-freedom, and admits simpler implementations that …

A randomized dining philosophers algorithm is presented for a realistic semi-synchronous
model where message delays vary within an unknown bound, and clocks may run at a …

It is well known that the consensus problem cannot be solved deterministically in an
asynchronous environment, but that randomized solutions are possible. We propose a new …

We study the scenario where a transient batch of faults hits a minority of the nodes in a
distributed system by corrupting their state. We concentrate on the basic persistent bit …