Abstract
Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure. In this paper, we present the first lock-free memory-management scheme that is applicable to general (arbitrary) lock-free data structures and that can be applied automatically via a compiler plug-in. In addition to the simplicity of incorporating to data structures, this scheme provides low overhead and does not rely on the lock freedom of any OS services.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
19 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. Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization;IEEE Transactions on Parallel and Distributed Systems;2024-02
3. Applying Hazard Pointers to More Concurrent Data Structures;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
4. Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
5. The ERA Theorem for Safe Memory Reclamation;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16