Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks

DOI10.1007/978-3-642-33651-5_20MaRDI QIDQ4909418zbMATH OpenOpenAlexFDO

Authors Prasad Jayanti, Zhiyu Liu

Publication date 13 March 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33651-5_20

zbMATH Keywords

synchronizationmutual exclusionRMR complexityconcurrent algorithmabortabilityreader-writer exclusionshared-memory algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• On the Complexity of Reader-Writer Locks
• Recoverable mutual exclusion with abortability
• scientific article; zbMATH DE number 7699455
• Adaptive and efficient abortable mutual exclusion
• RMR-efficient randomized abortable mutual exclusion (extended abstract)
• Constant Amortized RMR Abortable Mutex for CC and DSM
• scientific article; zbMATH DE number 4049031
• Iterative computations with ordered read-write locks
• Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

This page was built for publication: Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks

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