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

Fast non-volatile memory (NVM) has sparked interest in log-free data structures (LFDs) that
enable crash recovery without the overhead of logging. However, recovery hinges on …

Transactional data structures allow data structures to support transactional execution, in
which a sequence of operations appears to execute atomically. We consider a paradigm in …

Adjacency lists are frequently used in graphing or map based applications. Although
efficient concurrent linked-list algorithms are well known, it can be difficult to adapt these …

This paper presents an extended version of our previous work on using compiler technology
to automatically convert sequential C++ data abstractions, for example, queues, stacks …

Emerging byte-addressable Non-Volatile Memories (NVMs) enable persistent memory
where process state can be recovered after crashes. To enable applications to rely on …

This paper investigates using compiler technology to automatically convert sequential C++
data abstractions, eg, queues, stacks, maps, and trees, to concurrent lock-free …

The explosive growth of online services, leading to unforeseen scales, has made modern
datacenters highly prone to failures. Taming these failures hinges on fast and correct …

Cloud computing needs to process and analyze massive high-dimensional data in a real-
time manner. Approximate queries in cloud computing systems can provide timely queried …

The optimistic concurrency control (OCC) utilized by in-memory databases performs writes
on thread-local copies and makes the writes visible upon passing validation. However, high …