Constant RMR solutions to reader writer synchronization

DOI10.1145/1835698.1835803MaRDI QIDQ5176222zbMATH OpenOpenAlexFDO

Authors Vibhor Bhatt, Prasad Jayanti

Publication date 2 March 2015

Published in Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

synchronizationmutual exclusionreader-writer lockRemote Memory Reference (RMR)

Mathematics Subject Classification ID

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

Recommendations

• On the Complexity of Reader-Writer Locks
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• Randomized mutual exclusion in \(\mathcal{O}(\log N / \log \log N)\) RMRs
• An \(O(1)\)-barriers optimal RMRs mutual exclusion algorithm (extended abstract)
• Mutual exclusion algorithms with constant RMR complexity and wait-free exit code

Cites work

• Elastic Transactions
• Software transactional memory
• Toward a theory of transactional contention managers

Cited in

(3)

• A time complexity lower bound for adaptive mutual exclusion
• Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
• Adaptive and fair transformation for recoverable mutual exclusion

Describes a project that uses

Uses Software

• CCSTM

This page was built for publication: Constant RMR solutions to reader writer synchronization

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