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

DOI10.1007/s004460050039zbMath1448.68062OpenAlexW1992427547MaRDI QIDQ5137344

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

shared-memory multiprocessorsresiliencywait-freelocal spinning\(k\)-exclusion\(k\)-assignmentshared subjects

Mathematics Subject Classification ID

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

Related Items (3)

An adaptive collect algorithm with applications ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Tight space bounds for \(\ell\)-exclusion

Cites Work

• A fine-grained solution to the mutual exclusion problem
• Time/contention trade-offs for multiprocessor synchronization
• Composite registers
• Renaming in an asynchronous environment
• Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
• Adaptive solutions to the mutual exclusion problem
• Universal constructions for multi-object operations
• Unnamed Item

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