A marriage of pointer- and epoch-based reclamation-Reference-Cited by-同舟云学术

A marriage of pointer- and epoch-based reclamation

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
language:
Short-container-title:

Author:

Kang Jeehoon¹,Jung Jaehwang¹

Affiliation:

1. KAIST, South Korea

Publisher

ACM

Link

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

Reference67 articles.

1. Dan Alistarh Patrick Eugster Maurice Herlihy Alexander Matveev and Nir Shavit. 2014. StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation. In EuroSys ’14. Dan Alistarh Patrick Eugster Maurice Herlihy Alexander Matveev and Nir Shavit. 2014. StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation. In EuroSys ’14.

2. ThreadScan

3. ThreadScan

4. Austin Appleby. 2012. MurmurHash3. https://github.com/aappleby/ smhasher/blob/master/src/MurmurHash3.cpp Austin Appleby. 2012. MurmurHash3. https://github.com/aappleby/ smhasher/blob/master/src/MurmurHash3.cpp

5. Hagit Attiya Rachid Guerraoui Danny Hendler Petr Kuznetsov Maged M. Michael and Martin Vechev. 2011. Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot Be Eliminated. In POPL ’11. Hagit Attiya Rachid Guerraoui Danny Hendler Petr Kuznetsov Maged M. Michael and Martin Vechev. 2011. Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot Be Eliminated. In POPL ’11.

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

1. A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation;Proceedings of the ACM on Programming Languages;2024-06-20

2. Expediting Hazard Pointers with Bounded RCU Critical Sections;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. Are Your Epochs Too Epic? Batch Free Can Be Harmful;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. Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic;Proceedings of the ACM on Programming Languages;2023-10-16