Fault-Tolerant Message-Passing Distributed Systems Page 1 Michel Raynal Fault-Tolerant
Message-Passing Distributed Systems An Algorithmic Approach Page 2 Fault-Tolerant …

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 …

The atomic snapshot object is an important primitive used for the design and verification of
wait-free algorithms in shared-memory distributed systems. A snapshot object is a shared …

The snapshot object is an important tool for constructing wait-free asynchronous algorithms.
We relate the snapshot object to the lattice agreement decision problem. It is shown that any …

Lattice agreement is a key decision problem in distributed systems. In this problem,
processes start with input values from a lattice, and must learn (non-trivial) values that form a …

We introduce concurrent time-stam**, a paradigm that allows processes to temporally
order concurrent events in an asynchronous shared-memory system. Concurrent time-stamp …

In a shared-memory system, n independent asynchronous processes, with distinct names in
the range {0,..., N-1}, communicate by reading and writing to shared registers. An algorithm …

The Step Complexity of Multidimensional Approximate Agreement Page 1 The Step
Complexity of Multidimensional Approximate Agreement Hagit Attiya Department of Computer …

This article presents constructions of useful concurrent data structures, including max
registers and counters, with step complexity that is sublinear in the number of processes, n …

Abstract Concurrent Timestamp Systems (ctss) allow processes to temporally order
concurrent events in an asynchronous shared memory system. Bounded memory …