VERLIB: Concurrent Versioned Pointers
Guy E. Blelloch, Yuanhao Wei
2024Year
6Citations
2Top-tier citations
Abstract
Recent work has shown how to augment any CAS-based concurrent data structure to support taking a snapshot of the current memory state. Taking the snapshot, as well as loads and CAS (Compare and Swap) operations, take constant time. Importantly, such snapshotting can be used to easily implement linearizable queries, such as range queries, over any part of a data structure.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b0aecb87-104f-4349-bbcb-2912fac6a3eaCited by top-tier papers2
- Concurrent Balanced Augmented TreesEvan Wrench, Ajay Singh, Younghun Roh, Panagiota Fatourou et al.PPoPP 2026
- Multiverse: Transactional Memory with Dynamic MultiversioningGaetano Coccimiglio, Trevor Brown, Srivatsan RaviPPoPP 2026
Related papers
- Constant-time snapshots with applications to concurrent data structuresYuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou et al.PPoPP 2021 · 37 citations
- Bundling linked data structures for linearizable range queriesJacob Nelson-Slivon, Ahmed Hassan, Roberto PalmieriPPoPP 2022 · 11 citations
- Concurrent sizeGal Sela, Erez PetrankOOPSLA 2022 · 3 citations
- Efficient Concurrent Updates to Persistent Randomized Binary Search TreesGuanhao Hou, Jinchao Huang, Fangyuan Zhang, Sibo WangVLDB 2025 · 1 citation
- Scaling concurrent queues by using HTM to profit from failed atomic operationsOr Ostrovsky, Adam MorrisonPPoPP 2020 · 6 citations
