Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining-Reference-Cited by-同舟云学术

Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Jayanti Prasad¹^ORCID,Jayanti Siddhartha²^ORCID,Joshi Anup³^ORCID

Affiliation:

1. Dartmouth College, Hanover, NH, USA

2. Google Research, Atlanta, GA, USA

3. Yahoo! Inc., Sunnyvale, CA, USA

Funder

Dartmouth College

Department of Defense

Publisher

ACM

Link

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

Reference31 articles.

1. Hagit Attiya Ohad Ben-Baruch and Danny Hendler. 2018a. Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory.. In PODC Calvin Newport and Idit Keidar (Eds.). ACM 7--16. http://dblp.uni-trier.de/db/conf/podc/podc2018.html#AttiyaBH18 Hagit Attiya Ohad Ben-Baruch and Danny Hendler. 2018a. Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory.. In PODC Calvin Newport and Idit Keidar (Eds.). ACM 7--16. http://dblp.uni-trier.de/db/conf/podc/podc2018.html#AttiyaBH18

2. Nesting-Safe Recoverable Linearizability

3. Naama Ben-David , Guy E. Blelloch , Michal Friedman , and Yuanhao Wei . 2019 . Delay-Free Concurrency on Faulty Persistent Memory. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures ( Phoenix, AZ, USA) (SPAA '19). Association for Computing Machinery, New York, NY, USA, 253--264. https://doi.org/10.1145/3323165.3323187 10.1145/3323165.3323187 Naama Ben-David, Guy E. Blelloch, Michal Friedman, and Yuanhao Wei. 2019. Delay-Free Concurrency on Faulty Persistent Memory. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (Phoenix, AZ, USA) (SPAA '19). Association for Computing Machinery, New York, NY, USA, 253--264. https://doi.org/10.1145/3323165.3323187

4. Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives

5. David Yu Cheng Chan and Philipp Woelfel. 2021. Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. (2021) 533--543. https://doi.org/10.1145/3465084.3467938 10.1145/3465084.3467938