Using local-spin k-exclusion algorithms to improve wait-free object implementations

DOI10.1007/S004460050039MaRDI QIDQ5137344zbMATH OpenOpenAlexFDO

Authors James H. Anderson, Mark Moir

Publication date 2 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004460050039

zbMATH Keywords

\(k\)-assignment\(k\)-exclusionlocal spinningresiliencyshared subjectsshared-memory multiprocessorswait-free

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 1263230
• The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes
• scientific article; zbMATH DE number 1796997
• A fast, scalable mutual exclusion algorithm

Cites work

• A fine-grained solution to the mutual exclusion problem
• Adaptive solutions to the mutual exclusion problem
• Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
• Composite registers
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• Renaming in an asynchronous environment
• Time/contention trade-offs for multiprocessor synchronization
• Universal constructions for multi-object operations

Cited in

(4)

• Tight space bounds for \(\ell\)-exclusion
• Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
• An adaptive collect algorithm with applications
• Shared-memory mutual exclusion: major research trends since 1986

This page was built for publication: Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations

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