Skip to Main content Skip to Navigation
Conference papers

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model

Abstract : We present an abortable mutual exclusion algorithm for the cache-coherent (CC) model with atomic registers and CAS objects. The algorithm has constant expected amortized RMR complexity in the oblivious adversary model and is deterministically deadlock-free. This is the first abortable mutual exclusion algorithm that achieves o(log n/log log n) RMR complexity.
Document type :
Conference papers
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download

https://hal.inria.fr/hal-01635734
Contributor : George Giakkoupis <>
Submitted on : Wednesday, November 15, 2017 - 3:57:47 PM
Last modification on : Saturday, July 11, 2020 - 3:15:29 AM
Long-term archiving on: : Friday, February 16, 2018 - 3:55:36 PM

File

podc2017mutex.pdf
Files produced by the author(s)

Identifiers

Citation

George Giakkoupis, Philipp Woelfel. Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. PODC 2017 - Proceedings of the 36th ACM Symposium on Principles of Distributed Computing, Jul 2017, Washington, DC, United States. ⟨10.1145/3087801.3087837⟩. ⟨hal-01635734⟩

Share

Metrics

Record views

306

Files downloads

250