Multiversioning is widely used in databases, transactional memory, and concurrent data
structures. It can be used to support read-only transactions that appear atomic in the …

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 …

Non-blocking search data structures offer scalability with a progress guarantee on high-
performance multi-core architectures. In the recent past," learned queries" have gained …

Skiplists have become prevalent in systems. The main advantages of skiplists are their
simplicity and ease of implementation, and the ability to support operations in the same …

Lock-free concurrent data structures offer throughput with scalability and guarantees for the
completion of operations on multicore computers. Recently, queries using machine learning …

Concurrent data structures serve as fundamental building blocks for concurrent computing.
Many concurrent counterparts have been designed for basic sequential mechanisms; …

The Skiplist, or skip list, originally designed as an in-memory data structure, has attracted a
lot of attention in recent years as a main-memory component in many NoSQL, cloud-based …

Scalable concurrent data structures are essential for unlocking the potential of modern
multicore machines. This thesis presents techniques for enhancing existing concurrent data …

Designing high-performance, highly-concurrent linearizable data structures is complex,
especially when bulk operations (eg, range queries) are included. Relying on a single …

To date, existing quiescent-state-based safe memory reclamation algorithms have relied on
a global epoch counter maintained through software timestamps. While most quiescent-state …