This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …

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 …

We present a new simple wait-free universal construction, called Sim, that uses just a
Fetch&Add and an LL/SC object and performs a constant number of shared memory …

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 …

Given a concurrent data structure, we present an approach for efficiently taking snapshots of
its constituent CAS objects. More specifically, we support a constant-time operation that …

Transactional memory (TM) is a promising approach for designing concurrent data
structures, and it is essential to develop better understanding of the formal properties that …

Graphs are versatile data structures that allow the implementation of a variety of
applications, such as computer-aided design and manufacturing, video gaming, or scientific …

We study a simple technique, originally presented by Herlihy (ACM Trans. Program. Lang.
Syst. 15 (5): 745–770, 1993), for executing concurrently, in a wait-free manner, blocks of …

Efficient concurrent data structures that support range queries are highly sought-after in a
number of application areas. For example, the contemporary big-data processing platforms …

This work consideres asynchronous shared memory systems in which any number of
processes may crash. It identifies relaxations of fetch & increment, queues, sets and stacks …