Concurrent data structures for near-memory computing
The performance gap between memory and CPU has grown exponentially. To bridge this
gap, hardware architects have proposed near-memory computing (also called processing-in …
gap, hardware architects have proposed near-memory computing (also called processing-in …
Black-box concurrent data structures for NUMA architectures
High-performance servers are Non-Uniform Memory Access (NUMA) machines. To fully
leverage these machines, programmers need efficient concurrent data structures that are …
leverage these machines, programmers need efficient concurrent data structures that are …
[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 …
Mv-rlu: Scaling read-log-update with multi-versioning
This paper presents multi-version read-log-update (MV-RLU), an extension of the read-log-
update (RLU) synchronization mechanism. While RLU has many merits including an …
update (RLU) synchronization mechanism. While RLU has many merits including an …
System and method for efficient concurrent queue implementation
O Otenko - US Patent 8,607,249, 2013 - Google Patents
A method, system, and medium are disclosed for facilitating communication between
multiple concurrent threads of execution using an efficient concurrent queue. The efficient …
multiple concurrent threads of execution using an efficient concurrent queue. The efficient …
Wait-free concurrent graph objects with dynamic traversals
ND Kallimanis, E Kanellou - 19th International Conference on …, 2016 - drops.dagstuhl.de
Graphs are versatile data structures that allow the implementation of a variety of
applications, such as computer-aided design and manufacturing, video gaming, or scientific …
applications, such as computer-aided design and manufacturing, video gaming, or scientific …
Modular verification of concurrency-aware linearizability
N Hemed, N Rinetzky, V Vafeiadis - … , DISC 2015, Tokyo, Japan, October 7 …, 2015 - Springer
Linearizability is the de facto correctness condition for concurrent objects. Informally,
linearizable objects provide the illusion that each operation takes effect instantaneously at a …
linearizable objects provide the illusion that each operation takes effect instantaneously at a …
Lightweight contention management for efficient compare-and-swap operations
Many concurrent data-structure implementations use the well-known compare-and-swap
(CAS) operation, supported in hardware by most modern multiprocessor architectures, for …
(CAS) operation, supported in hardware by most modern multiprocessor architectures, for …
Effective cluster assignment for modulo scheduling
E Nystrom, AE Eichenberger - Proceedings. 31st Annual ACM …, 1998 - ieeexplore.ieee.org
Clustering is one solution to the demand for wide issue machines and fast clock cycles
because it allows for smaller, less ported register files and simpler bypass logic while …
because it allows for smaller, less ported register files and simpler bypass logic while …
Fast and scalable channels in kotlin coroutines
N Koval, D Alistarh, R Elizarov - Proceedings of the 28th ACM SIGPLAN …, 2023 - dl.acm.org
Asynchronous programming has gained significant popularity over the last decade: support
for this programming pattern is available in many popular languages via libraries and native …
for this programming pattern is available in many popular languages via libraries and native …