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

A wait-free implementation of a concurrent data object is one that guarantees that any
process can complete any operation in a finite number of steps, regardless of the execution …

The Art of Multiprocessor Programming, Second Edition, provides users with an authoritative
guide to multicore programming. This updated edition introduces higher level software …

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

Emulators that translate algorithms from the shared-memory model to two different message-
passing models are presented. Both are achieved by implementing a wait-free, atomic …

This paper introduces a general formulation of atomic snapshot memory, a shared memory
partitioned into words written (updated) by individual processes, or instantaneously read …

The debugging cycle is the most common methodology for finding and correcting errors in
sequential programs. Cyclic debugging is effective because sequential programs are …

In modern computing a program is usually distributed among several processes. The
fundamental challenge when develo** reliable distributed programs is to support the …

A Hjait-free implementation of a concurrent data object is one that guarantees that any
process can complete any operation in a fmitt number of steps, regardless of the execution …

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 …