Lock-free locks revisited-Reference-Cited by-同舟云学术

Lock-free locks revisited

Published:2022-03-28 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
language:
Short-container-title:

Author:

Ben-David Naama¹,Blelloch Guy E.²,Wei Yuanhao²

Affiliation:

1. VMware Research

2. Carnegie Mellon University

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference53 articles.

1. Maya Arbel-Raviv , Trevor Brown , and Adam Morrison . 2018 . Getting to the Root of Concurrent Binary Search Tree Performance . In USENIX Annual Technical Conference. 295--306 . Maya Arbel-Raviv, Trevor Brown, and Adam Morrison. 2018. Getting to the Root of Concurrent Binary Search Tree Performance. In USENIX Annual Technical Conference. 295--306.

2. Built-in Coloring for Highly-Concurrent Doubly-Linked Lists

3. A method for implementing lock-free shared-data structures

4. R. Bayer and M. Schkolnick. 1988. Concurrency of Operations on B-Trees. Morgan Kaufmann Publishers Inc. San Francisco CA USA 129--139. R. Bayer and M. Schkolnick. 1988. Concurrency of Operations on B-Trees. Morgan Kaufmann Publishers Inc. San Francisco CA USA 129--139.

5. Naama Ben-David and Guy E . Blelloch . 2021 . Fast and Fair Lock-Free Locks . arXiv:2108.04520 [cs.DC] Naama Ben-David and Guy E. Blelloch. 2021. Fast and Fair Lock-Free Locks. arXiv:2108.04520 [cs.DC]

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

1. Lock-Free Locks Revisited (Abstract);Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing;2024-06-17

2. Separating Mechanism from Policy in STM;2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT);2023-10-21

3. Fast and Fair Randomized Wait-Free Locks;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

4. Lock-free locks revisited;Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2022-03-28