A Formal Reduction for Lock-Free Parallel Algorithms
Abstract elided by the publisher.
Related papers
- FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue PPoPP 2008
- Lock-free and scalable multi-version software transactional memory PPoPP 2011
- Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swapping Haskell 2017
- Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs TOPLAS 1996
- Automatic memory reclamation for lock-free data structures OOPSLA 2015
- Fast concurrent lock-free binary search trees PPoPP 2014
- A lock-free relaxed concurrent queue for fast work distribution PPoPP 2021
- Verifying Lock-Free Traversals in Relaxed Memory Separation Logic PLDI 2025