This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

This paper presents a new family of models of distributed-computation which combines
features from synchronous, asynchronous, and failure-detectoraugmented systems. Like …

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 …

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 …

This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs
of a given model of distributed computation. Using layering, a model-independent analysis …

Towards a topological characterization of asynchronous complexity Page 1 Towards a
Topological Characterization of Asynchronous Complexity (Preliminary Version) Gunnar Hoest …

This paper presents a self-contained study of wait-free solvable tasks. A new necessary
condition for wait-free solvability, based on a restricted set of executions, is proved. This set …

A synchronous message passing complete network with an adversary that may purge
messages is used to precisely model tasks that are read-write wait-free computable. In the …

In the renaming task n+ 1 processes start with unique input names taken from a large space
and must choose unique output names taken from a smaller name space, 0, 1,..., K. To rule …

We take a significant step toward unifying the synchronous, semi-synchronous, and
asynchronous message-passing models of distributed computation. The key idea is the …