Minimizing coordination, or blocking communication between concurrently executing
operations, is key to maximizing scalability, availability, and high performance in database …

Multi-versioned database systems have the potential to significantly increase the amount of
concurrency in transaction processing because they can avoid read-write conflicts …

What opportunities for multicore scalability are latent in software interfaces, such as system
call APIs? Can scalability challenges and opportunities be identified even before any …

Sharding is a popular way to achieve scalability in blockchain protocols, increasing their
throughput by partitioning the set of transaction validators into a number of smaller …

This monograph grows out of nearly 40 years of experience in synchronization and
concurrent data structures. Though written primarily from the perspective of systems …

There is a trade-off between performance and correctness in implementing concurrent data
structures. Better performance may be achieved at the expense of relaxing correctness, by …

The purpose of this book is to help you program shared-memory parallel systems without
risking your sanity. Nevertheless, you should think of the information in this book as a …

With the merits of high density, non-volatility, and DRAM-scale latency/bandwidth, persistent
memory (PM) brings hope to high-performance storage systems, in which hashing-based …

A Linearizability-based Hierarchy for Concurrent Specifications Page 1 86 COMMUNICATIONS
OF THE ACM | JANUARY 2023 | VOL. 66 | NO. 1 review articles IMA GE B Y CREA TIVENEK O …

We present algorithms for shrinking and expanding a hash table while allowing concurrent,
wait-free, linearly scalable lookups. These resize algorithms allow Read-Copy Update …