[BOOK][B] Shared-memory synchronization
ML Scott, T Brown - 2013 - Springer
This monograph grows out of nearly 40 years of experience in synchronization and
concurrent data structures. Though written primarily from the perspective of systems …
concurrent data structures. Though written primarily from the perspective of systems …
{Multi-Queue} fair queuing
Modern high-speed devices (eg, network adapters, storage, accelerators) use new host
interfaces, which expose multiple software queues directly to the device. These multi-queue …
interfaces, which expose multiple software queues directly to the device. These multi-queue …
Is Parallel Programming Hard, And, If So, What Can You Do About It?(Release v2023. 06.11 a)
PE McKenney - arxiv preprint arxiv:1701.00854, 2017 - arxiv.org
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 …
risking your sanity. Nevertheless, you should think of the information in this book as a …
{D2FQ}:{Device-Direct} Fair Queueing for {NVMe}{SSDs}
With modern high-performance SSDs that can handle parallel I/O requests from multiple
tenants, fair sharing of block I/O is an essential requirement for performance isolation …
tenants, fair sharing of block I/O is an essential requirement for performance isolation …
Fast Nonblocking Persistence for Concurrent Data Structures
We present a fully lock-free variant of the recent Montage system for persistent data
structures. Our variant, nbMontage, adds persistence to almost any nonblocking concurrent …
structures. Our variant, nbMontage, adds persistence to almost any nonblocking concurrent …
A fast, general system for buffered persistent data structures
The emergence of fast, dense, nonvolatile main memory suggests that certain long-lived
data might remain in their natural pointer-rich format across program runs and hardware …
data might remain in their natural pointer-rich format across program runs and hardware …
Predicate rcu: An rcu for scalable concurrent updates
Read-copy update (RCU) is a shared memory synchronization mechanism with scalable
synchronization-free reads that nevertheless execute correctly with concurrent updates. To …
synchronization-free reads that nevertheless execute correctly with concurrent updates. To …
Transactional acceleration of concurrent data structures
Concurrent data structures are a fundamental building block for scalable multi-threaded
programs. While Transactional Memory (TM) was originally conceived as a mechanism for …
programs. While Transactional Memory (TM) was originally conceived as a mechanism for …
[BOOK][B] Crafting concurrent data structures
Y Liu - 2015 - search.proquest.com
Concurrent data structures lie at the heart of modern parallel programs. The design and
implementation of concurrent data structures can be challenging due to the demand for …
implementation of concurrent data structures can be challenging due to the demand for …
[BOOK][B] Memory Management and Persistency of Multithreaded Applications
H Wen - 2022 - search.proquest.com
Memory Management and Persistency of Multithreaded Applications Page 1 Memory
Management and Persistency of Multithreaded Applications by Haosen Wen Submitted in Partial …
Management and Persistency of Multithreaded Applications by Haosen Wen Submitted in Partial …