Adaptive mutual exclusion with local spinning

DOI10.1007/S00446-006-0009-6zbMath1266.68216OpenAlexW2124129198MaRDI QIDQ1954201

James H. Anderson, Yong-Jik Kim

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0009-6

zbMATH Keywords

time complexityadaptive mutual exclusionshared-memory systemsread/write atomicitylocal spinning

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (2)

A time complexity lower bound for adaptive mutual exclusion ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion

Cites Work

• Speeding Lamport's fast mutual exclusion algorithm
• A fine-grained solution to the mutual exclusion problem
• A space- and time-efficient local-spin spin lock.
• Wait-free algorithms for fast, long-lived renaming
• Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
• A new solution of Dijkstra's concurrent programming problem
• Adaptive and efficient mutual exclusion (extended abstract)
• Improving fast mutual exclusion
• Universal constructions for multi-object operations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adaptive mutual exclusion with local spinning