A generic local-spin fetch-and--based mutual exclusion algorithm

DOI10.1016/J.JPDC.2006.11.006MaRDI QIDQ882148zbMATH OpenOpenAlexFDO

Authors James H. Anderson, Yong-Jik Kim

Publication date 23 May 2007

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2006.11.006

zbMATH Keywords

fetch-and-\(\phi\) primitiveslocal spinningshared-memory mutual exclusiontheory of concurrent algorithmstime complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved lower bound for the time complexity of mutual exclusion
• A fast, scalable mutual exclusion algorithm
• Adaptive mutual exclusion with local spinning
• Timing-based mutual exclusion with local spinning. (Extended abstract)
• scientific article; zbMATH DE number 1696664

Cited in

(1)

• RMR-efficient implementations of comparison primitives using read and write operations

This page was built for publication: A generic local-spin fetch-and-\(\phi\)-based mutual exclusion algorithm

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