Nonatomic mutual exclusion with local spinning
From MaRDI portal
Publication:1954193
DOI10.1007/s00446-006-0003-zzbMath1266.68215OpenAlexW2170551746MaRDI QIDQ1954193
Yong-Jik Kim, James H. Anderson
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-0003-z
Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)
Related Items (4)
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Randomized mutual exclusion with sub-logarithmic RMR-complexity ⋮ Unnamed Item ⋮ Nonatomic dual bakery algorithm with bounded tokens
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On interprocess communication. II: Algorithms
- Atomic semantics of nonatomic programs
- Arbitration without common modifiable variables
- A fine-grained solution to the mutual exclusion problem
- Time/contention trade-offs for multiprocessor synchronization
- Contention-free complexity of shared memory algorithms
- The elusive atomic register
- Constructing 1-writer multireader multivalued atomic variables from regular variables
- A new solution of Dijkstra's concurrent programming problem
- Adaptive solutions to the mutual exclusion problem
- A fast, scalable mutual exclusion algorithm
- Long lived adaptive splitter and applications
- An improved lower bound for the time complexity of mutual exclusion
- Nonatomic mutual exclusion with local spinning
- Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
- Adaptive and efficient mutual exclusion (extended abstract)
- Improving fast mutual exclusion
- The mutual exclusion problem
This page was built for publication: Nonatomic mutual exclusion with local spinning
