The Art of Multiprocessor Programming, Second Edition, provides users with an authoritative
guide to multicore programming. This updated edition introduces higher level software …

Due to the latency difference between DRAM and non-volatile main memory (NVMM) and
the limited capacity of DRAM, incoming writes are often stalled in LSM tree-based key-value …

We introduce" asynchronized concurrency (ASCY)," a paradigm consisting of four
complementary programming patterns. ASCY calls for the design of concurrent search data …

In this paper, we present the most extensive comparison of synchronization techniques. We
evaluate 5 different synchronization techniques through a series of 31 data structure …

The recent availability of fast, dense, byte-addressable non-volatile memory has led to
increasing interest in the problem of designing durable data structures that can recover from …

Despite the wide adoption of graph processing across many different application domains,
there is no underlying data structure that can serve a variety of graph workloads (analytics …

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient
failures, assuming however that programmers have designed these structures such that their …

Read copy update (RCU) is a novel synchronization mechanism, in which the burden of
synchronization falls completely on the updaters, by having them wait for all pre-existing …

This paper introduces read-log-update (RLU), a novel extension of the popular read-copy-
update (RCU) synchronization mechanism that supports scalability of concurrent code by …

We present the CB tree, a counting-based self-adjusting binary search tree in which, as in
splay trees, more-frequently accessed items move closer to the root. In a sequential …