This monograph grows out of nearly 40 years of experience in synchronization and
concurrent data structures. Though written primarily from the perspective of systems …

Concurrent data structures that have fast and predictable performance are of critical
importance for harnessing the power of multicore processors, which are now ubiquitous …

Lock-free data structures guarantee overall system progress, whereas wait-free data
structures guarantee the progress of each and every thread, providing the desirable non …

A fundamental challenge in designing concurrent data structures is obtaining efficient wait-
free implementations, in which each operation completes regardless of the behavior of other …

Transactional data structures support threads executing a sequence of operations
atomically. Dynamic transactions allow operands to be generated on the fly and allows …

Modern big data processing platforms employ huge in-memory key-value (KV) maps. Their
applications simultaneously drive high-rate data ingestion and large-scale analytics. These …

In this paper, we present a universal memory reclamation scheme, Wait-Free Eras (WFE), for
deleted memory blocks in wait-free concurrent data structures. WFE's key innovation is that it …

The linked-list data structure is fundamental and ubiquitous. Lock-free versions of the linked-
list are well known. However, the existence of a practical wait-free linked-list has been open …

We present a safe automatic memory reclamation approach for concurrent programs, and
show that it is both theoretically and practically efficient. Our approach combines ideas from …

The vector is a fundamental data structure, which provides constant-time access to a
dynamically-resizable range of elements. Currently, there exist no wait-free vectors. The only …