VERLIB: Concurrent Versioned Pointers
Guy E. Blelloch, Yuanhao Wei
2024年份
6被引次数
2顶会引用
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper2
- Concurrent Balanced Augmented TreesEvan Wrench, Ajay Singh, Younghun Roh, Panagiota Fatourou 等PPoPP 2026
- Multiverse: Transactional Memory with Dynamic MultiversioningGaetano Coccimiglio, Trevor Brown, Srivatsan RaviPPoPP 2026
相关 Paper
- Constant-time snapshots with applications to concurrent data structuresYuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou 等PPoPP 2021 · 被引用 37 次
- Bundling linked data structures for linearizable range queriesJacob Nelson-Slivon, Ahmed Hassan, Roberto PalmieriPPoPP 2022 · 被引用 11 次
- Concurrent sizeGal Sela, Erez PetrankOOPSLA 2022 · 被引用 3 次
- Efficient Concurrent Updates to Persistent Randomized Binary Search TreesGuanhao Hou, Jinchao Huang, Fangyuan Zhang, Sibo WangVLDB 2025 · 被引用 1 次
- Scaling concurrent queues by using HTM to profit from failed atomic operationsOr Ostrovsky, Adam MorrisonPPoPP 2020 · 被引用 6 次
