A fast, scalable mutual exclusion algorithm

DOI10.1007/BF01784242zbMath1448.68171MaRDI QIDQ5137004

James H. Anderson, Jae-Heon Yang

Publication date: 30 November 2020

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

zbMATH Keywords

scalabilitytime complexitymutual exclusionread/write atomicitysynchronization primitiveslocal spinningfast mutual exclusion

Mathematics Subject Classification ID

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

Related Items (9)

On the inherent weakness of conditional primitives ⋮ Unnamed Item ⋮ Group mutual exclusion in linear time and space ⋮ Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion ⋮ Nonatomic mutual exclusion with local spinning ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Recoverable mutual exclusion ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms ⋮ A space- and time-efficient local-spin spin lock.

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Arbitration without common modifiable variables
• A fine-grained solution to the mutual exclusion problem
• Time bounds for mutual exclusion and related problems
• Improving fast mutual exclusion
• Fast, scalable synchronization with minimal hardware support

This page was built for publication: A fast, scalable mutual exclusion algorithm