Affiliation:
1. Technion, Israel Institute of Technology, Haifa, Israel
Abstract
The linked-list data structure is fundamental and ubiquitous. Lock-free versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
11 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. The ERA Theorem for Safe Memory Reclamation;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
3. DHash: Dynamic Hash Tables With Non-Blocking Regular Operations;IEEE Transactions on Parallel and Distributed Systems;2022-12-01
4. Functional Faults;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
5. Practical Progress Verification of Descriptor-Based Non-Blocking Data Structures;2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS);2019-10