Publication
Efficient Multi-Word Compare and Swap
Related publications (34)
Distributed Computing with Modern Shared Memory
In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...
EPFL2020OneFile: A Wait-free Persistent Transactional Memory
A persistent transactional memory (PTM) library provides an easy-to-use interface to programmers for using byte-addressable non-volatile memory (NVM). Previously proposed PTMs have, so far, been blocking. We present OneFile, the first wait-free PTM with in ...
IEEE COMPUTER SOC2019Lock-Unlock: Is That All? A Pragmatic Analysis of Locking in Software Systems
Rachid Guerraoui, Vasileios Trigonakis
A plethora of optimized mutex lock algorithms have been designed over the past 25 years to mitigate performance bottlenecks related to critical sections and locks. Unfortunately, there is currently no broad study of the behavior of these optimized lock alg ...
2019Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning
As hardware evolves, so do the needs of applications. To increase the performance of an application,
there exist two well-known approaches. These are scaling up an application, using a larger multi-core
platform, or scaling out, by distributing work to mul ...
EPFL2018Locking Made Easy
Rachid Guerraoui, Vasileios Trigonakis, Georgios Chatzopoulos, Jelena Antic
A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to lock before accessing the data and unlock after. Nevertheless, making locking efficient requires fine-tuning (a) the granularity of locks and (b) the locking ...
ACM Press2016Optimistic Concurrency with OPTIK
Rachid Guerraoui, Vasileios Trigonakis
We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...
ACM Press2016Fast and Robust Memory Reclamation for Concurrent Data Structures
Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau
In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...
2016Fast and Robust Memory Reclamation for Concurrent Data Structures
Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau
In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...
2016Applying HTM to an OLTP System: No Free Lunch
Anastasia Ailamaki, Pinar Tözün, Danica Porobic, David Cervini
Transactional memory is a promising way for implementing efficient synchronization mechanisms for multicore processors. Intel's introduction of hardware transactional memory (HTM) into their Haswell line of processors marks an important step toward mainstr ...
2015Efficient Communication and Synchronization on Manycore Processors
The increased number of cores integrated on a chip has brought about a number of challenges. Concerns about the scalability of cache coherence protocols have urged both researchers and practitioners to explore alternative programming models, where cache co ...
EPFL2015