Elimination (a,b)-trees with fast, durable updates-Reference-Cited by-同舟云学术

Elimination (a,b)-trees with fast, durable updates

Published:2022-03-28 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
language:
Short-container-title:

Author:

Srivastava Anubhav¹,Brown Trevor¹

Affiliation:

1. University of Waterloo, Waterloo, Canada

Funder

Canada Foundation for Innovation John R. Evans Leaders Fund

Ontario Research Fund CFI Leaders Opportunity Fund

Natural Sciences and Engineering Research Council of Canada (NSERC)

University of Waterloo

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3503221.3508441

Reference56 articles.

1. Atomic snapshots of shared memory

2. CBTree: A Practical Concurrent Self-Adjusting Search Tree

3. Harnessing epoch-based reclamation for efficient range queries

4. Maya Arbel-Raviv , Trevor Brown , and Adam Morrison . 2018 . Getting to the Root of Concurrent Binary Search Tree Performance . In 2018 USENIX Annual Technical Conference (USENIX ATC 18) . USENIX Association, Boston, MA, 295--306. https://www.usenix.org/conference/atc18/presentation/arbel-raviv Maya Arbel-Raviv, Trevor Brown, and Adam Morrison. 2018. Getting to the Root of Concurrent Binary Search Tree Performance. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). USENIX Association, Boston, MA, 295--306. https://www.usenix.org/conference/atc18/presentation/arbel-raviv

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Lock-free Learned Search Data Structure;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Practical Hardware Transactional vEB Trees;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

3. VERLIB: Concurrent Versioned Pointers;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

4. Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization;IEEE Transactions on Parallel and Distributed Systems;2024-02

5. PIM-trie: A Skew-resistant Trie for Processing-in-Memory;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17