Abstract
Lock-free data-structures are widely employed in practice, yet designing lock-free memory reclamation for them is notoriously difficult. In particular, all known lock-free reclamation schemes are ``manual'' in the sense that the developer has to specify when nodes have retired and may be reclaimed. Retiring nodes adequately is non-trivial and often requires the modification of the original lock-free algorithm. In this paper we present an automatic lock-free reclamation scheme for lock-free data-structures in the spirit of a mark-sweep garbage collection. The proposed algorithm works with any normalized lock-free algorithm and with no need for the programmer to retire nodes or make changes to the algorithm. Evaluation of the proposed scheme on a linked-list and a hash table shows that it performs similarly to the best manual (lock-free) memory reclamation scheme.
Funder
Israel Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization;IEEE Transactions on Parallel and Distributed Systems;2024-02
2. Separating Mechanism from Policy in STM;2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT);2023-10-21
3. The ERA Theorem for Safe Memory Reclamation;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
4. The ERA Theorem for Safe Memory Reclamation;Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2023-02-21
5. VBR: Version Based Reclamation;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06