The k-bakery, local-spin k-exclusion using non-atomic reads and writes

DOI10.1145/1835698.1835707MaRDI QIDQ5176188zbMATH OpenOpenAlexFDO

Authors Robert Danek

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.1835707

zbMATH Keywords

\(k\)-exclusionmutual exclusionremote memory referencessafe registersshared memory

Mathematics Subject Classification ID

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

Recommendations

• Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
• scientific article; zbMATH DE number 2089981
• An \(O(1)\)-barriers optimal RMRs mutual exclusion algorithm (extended abstract)
• Group mutual exclusion in linear time and space
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms

Cites work

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

Cited in

(8)

• Under the hood of the bakery algorithm: mutual exclusion as a matter of priority
• A time complexity lower bound for adaptive mutual exclusion
• scientific article; zbMATH DE number 1796997 (Why is no real title available?)
• Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
• scientific article; zbMATH DE number 2089981 (Why is no real title available?)
• Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
• Nonatomic dual bakery algorithm with bounded tokens
• Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms

Describes a project that uses

Uses Software

• CCSTM

This page was built for publication: The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes

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