A fast, scalable mutual exclusion algorithm

DOI10.1007/BF01784242MaRDI QIDQ5137004zbMATH OpenFDO

Authors Jae-Heon Yang, James H. Anderson

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 algorithms (68W15) Distributed systems (68M14)

Recommendations

• A new fast-path mechanism for mutual exclusion
• Improving fast mutual exclusion
• Nonatomic mutual exclusion with local spinning
• Time/contention trade-offs for multiprocessor synchronization
• An \(O(1)\)-barriers optimal RMRs mutual exclusion algorithm (extended abstract)

Cites work

• scientific article; zbMATH DE number 1331926 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• A fine-grained solution to the mutual exclusion problem
• Arbitration without common modifiable variables
• Fast, scalable synchronization with minimal hardware support
• Improving fast mutual exclusion
• Time bounds for mutual exclusion and related problems

Cited in

(35)

• A highly safe self-stabilizing mutual exclusion algorithm
• Nonatomic mutual exclusion with local spinning
• Remote memory references at block granularity
• Time/contention trade-offs for multiprocessor synchronization
• On the inherent weakness of conditional primitives
• Efficient multi-word locking using randomization
• Nonatomic mutual exclusion with local spinning
• A mutual exclusion algorithm with optimally bounded bypasses
• Group mutual exclusion in linear time and space
• The architectural and operating system implications on the performance of synchronization on ccNUMA multiprocessors
• Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
• A generic local-spin fetch-and-\(\phi\)-based mutual exclusion algorithm
• SOFSEM 2005: Theory and Practice of Computer Science
• Non-blocking timeout in scalable queue-based spin locks
• A space- and time-efficient local-spin spin lock.
• Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
• A new fast-path mechanism for mutual exclusion
• Shared-memory mutual exclusion: major research trends since 1986
• A scalable lock-free stack algorithm
• scientific article; zbMATH DE number 3848597 (Why is no real title available?)
• F-arrays, implementation and applications
• Tournaments for mutual exclusion: verification and concurrent complexity
• Adaptive and efficient mutual exclusion
• scientific article; zbMATH DE number 1263230 (Why is no real title available?)
• Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
• Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
• Speeding Lamport's fast mutual exclusion algorithm
• Spin-based reader-writer synchronization for multiprocessor real-time systems
• Mutual exclusion on a hypercube
• Queue based mutual exclusion with linearly bounded overtaking
• Allocate-on-use space complexity of shared-memory algorithms
• Improving fast mutual exclusion
• Fast and scalable rendezvousing
• Recoverable mutual exclusion
• Scalable room synchronizations

Describes a project that uses

Uses Software

• UNITY

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

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