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 …

This paper presents the first implementation of a search tree data structure in an
asynchronous shared-memory system that provides a wait-free algorithm for executing …

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 …

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

We present a general transformation that takes any concurrent data structure written using
CAS and adds wait-free linearizable query operations to it. These query operations may …

A Bibliography of Publications in Parallel Processing Letters Page 1 A Bibliography of
Publications in Parallel Processing Letters Nelson HF Beebe University of Utah Department of …