Adaptive and efficient abortable mutual exclusion

DOI10.1145/872035.872079MaRDI QIDQ2943766zbMATH OpenOpenAlexFDO

Authors Prasad Jayanti

Publication date 4 September 2015

Published in Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity
• A fast, scalable mutual exclusion algorithm
• Adaptive mutual exclusion with local spinning
• RMR-efficient randomized abortable mutual exclusion (extended abstract)
• Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model

Cited in

(11)

• Recoverable mutual exclusion with abortability
• Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
• A time complexity lower bound for adaptive mutual exclusion
• Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
• An almost tight RMR lower bound for abortable test-and-set
• Adaptive and efficient mutual exclusion
• Constant Amortized RMR Abortable Mutex for CC and DSM
• Non-blocking timeout in scalable queue-based spin locks
• Improving fast mutual exclusion
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• Strongly linearizable LL/SC from CAS

This page was built for publication: Adaptive and efficient abortable mutual exclusion

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