A fast, scalable mutual exclusion algorithm
From MaRDI portal
Recommendations
Cites work
- A fine-grained solution to the mutual exclusion problem
- Arbitration without common modifiable variables
- Fast, scalable synchronization with minimal hardware support
- scientific article; zbMATH DE number 1331926 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- Improving fast mutual exclusion
- Time bounds for mutual exclusion and related problems
Cited in
(40)- A mutual exclusion algorithm with optimally bounded bypasses
- Speeding Lamport's fast mutual exclusion algorithm
- A highly safe self-stabilizing mutual exclusion algorithm
- Tournaments for mutual exclusion: verification and concurrent complexity
- Group mutual exclusion in linear time and space
- A space- and time-efficient local-spin spin lock.
- Scalable room synchronizations
- Time/contention trade-offs for multiprocessor synchronization
- Nonatomic mutual exclusion with local spinning
- Recoverable mutual exclusion
- A visit to mutual exclusion in seven dates
- Mutual exclusion on a hypercube
- On the inherent weakness of conditional primitives
- Fast and scalable rendezvousing
- Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
- Adaptive and efficient abortable mutual exclusion
- Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
- Remote memory references at block granularity
- scientific article; zbMATH DE number 3848597 (Why is no real title available?)
- scientific article; zbMATH DE number 1263230 (Why is no real title available?)
- An Algorithm For Concurrency Control In Replicated File Systems
- Allocate-on-use space complexity of shared-memory algorithms
- Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
- A new fast-path mechanism for mutual exclusion
- Adaptive and efficient mutual exclusion
- Shared-memory mutual exclusion: major research trends since 1986
- Nonatomic mutual exclusion with local spinning
- Non-blocking timeout in scalable queue-based spin locks
- F-arrays, implementation and applications
- Efficient multi-word locking using randomization
- Queue based mutual exclusion with linearly bounded overtaking
- Improving fast mutual exclusion
- SOFSEM 2005: Theory and Practice of Computer Science
- The architectural and operating system implications on the performance of synchronization on ccNUMA multiprocessors
- Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
- A scalable lock-free stack algorithm
- Recoverable, abortable, and adaptive mutual exclusion with sublogarithmic RMR complexity
- Adaptive and fair transformation for recoverable mutual exclusion
- A generic local-spin fetch-and-\(\phi\)-based mutual exclusion algorithm
- Spin-based reader-writer synchronization for multiprocessor real-time systems
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)
