Constant Amortized RMR Abortable Mutex for CC and DSM

DOI10.1145/3293611.3331592OpenAlexW2964213803MaRDI QIDQ5145197FDOQ5145197

Authors Prasad Jayanti, S. Jayanti

Publication date 20 January 2021

Published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3293611.3331592

zbMATH Keywords

CCmutual exclusionDSMamortizedmutexabortableAFCFSconstant RMRfast abort

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model
• Adaptive and efficient abortable mutual exclusion
• Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity
• Recoverable mutual exclusion with abortability
• RMR-efficient randomized abortable mutual exclusion (extended abstract)

Cited in

(2)

• Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
• Recoverable mutual exclusion with abortability

This page was built for publication: Constant Amortized RMR Abortable Mutex for CC and DSM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145197)