In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing,
and analyzing distributed algorithms. She directs her book at a wide audience, including …

* Comprehensive introduction to the fundamental results in the mathematical foundations of
distributed computing* Accompanied by supporting material, such as lecture notes and …

Distributed Computing Through Combinatorial Topology describes techniques for analyzing
distributed algorithms based on award winning combinatorial topology research. The …

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 …

Problems in fault-tolerant distributed computing have been studied in a variety of models.
These models are structured around two central ideas:(1) degree of synchrony and failure …

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 …

In this issue of the distributed computing column, Kyrill Winkler and Ulrich Schmid present
an interesting survey of recent research trends on consensus proto-cols in dynamic …

We present a shared memory algorithm that allows a set of f+ 1 processes to wait-free
“simulate” a larger system of n processes, that may also exhibit up to f stop** failures …

This article introduces and explores the condition-based approach to solve the consensus
problem in asynchronous systems. The approach studies conditions that identify sets of …

The time complexity of wait-free algorithms in “normal” executions, where no failures occur
and processes operate at approximately the same speed, is considered. A lower bound of …