Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool for designing
concurrent algorithms. Yet, its widespread usage has been limited because lock-free …

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 …

The ring buffer is a staple data structure used in many algorithms and applications. It is
highly desirable in high-demand use cases such as multimedia, network routing, and trading …

A ring buffer or cyclical queue is a First In, First Out (FIFO) queue that stores elements on a
fixed-length array. This allows for efficient O (1) operations, cache-aware optimizations, and …

Non-blocking algorithms are a class of algorithms that provide guarantees of progress within
a system. These progress guarantees come from the fine-grained synchronization …

While developed largely for higher density and lower power, byte-addressable nonvolatile
memory can also allow data to persist across program runs and system crashes without the …

The development of non-blocking code is difficult; developers must ensure the progress of
an operation on shared memory despite conflicting operations. Managing this shared …

This paper presents a new and practical approach to lock-free locks based on helping,
which allows the user to write code using fine-grained locks, but run it in a lock-free manner …

Recent work has shown how to augment any CAS-based concurrent data structure to
support taking a snapshot of the current memory state. Taking the snapshot, as well as loads …

Critical sections that read, modify, and write (RMW) a small set of addresses are common in
parallel applications and concurrent data structures. However, to escape from the intricacies …