A Lazy Concurrent List-Based Set Algorithm-Reference-Cited by-同舟云学术

A Lazy Concurrent List-Based Set Algorithm

Published:2006 Issue: Volume: Page:3-16
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Heller Steve,Herlihy Maurice,Luchangco Victor,Moir Mark,Scherer William N.,Shavit Nir

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11795490_3

Reference14 articles.

1. Bayer, R., Schkolnick, M.: Concurrency of operations on b-trees. Acta Informatica 9, 1–21 (1977)

2. Eckel, B.: Thinking in Java, 2nd edn. Pearson Education (2000)

3. Lecture Notes in Computer Science;T. Harris,2001

4. Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)

5. Herlihy, M., Luchangco, V., Moir, M.: The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. In: Proceedings of the 16th International Symposium on Distributed Computing, vol. 2508, pp. 339–353. Springer, Heidelberg (2002)

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

1. Lower Bounds on the Amortized Time Complexity of Shared Objects;Theory of Computing Systems;2024-07-12

2. Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked List;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

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

4. A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability;Proceedings of the ACM on Programming Languages;2024-01-05

5. Intrathread Method Orders Based Adaptive Testing of Concurrent Objects;Lecture Notes in Computer Science;2024