Improving fast mutual exclusion
From MaRDI portal
Recommendations
- A new fast-path mechanism for mutual exclusion
- A fast, scalable mutual exclusion algorithm
- Adaptive and efficient mutual exclusion
- A fine-grained solution to the mutual exclusion problem
- Adaptive and efficient abortable mutual exclusion
- A more efficient generalization of Peterson's mutual exclusion algorithm
- scientific article; zbMATH DE number 1630127
- Superstabilizing mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
Cited in
(18)- A mutual exclusion algorithm with optimally bounded bypasses
- Speeding Lamport's fast mutual exclusion algorithm
- Tournaments for mutual exclusion: verification and concurrent complexity
- Nonatomic mutual exclusion with local spinning
- Adaptive mutual exclusion with local spinning
- Mutual exclusion on a hypercube
- scientific article; zbMATH DE number 1630127 (Why is no real title available?)
- Mutual Exclusion by Interpolation
- A time complexity lower bound for adaptive mutual exclusion
- Adaptive solutions to the mutual exclusion problem
- A fast, scalable mutual exclusion algorithm
- Fast timing-based algorithms
- Long lived adaptive splitter and applications
- Adaptive and efficient mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
- Shared-memory mutual exclusion: major research trends since 1986
- Queue based mutual exclusion with linearly bounded overtaking
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
This page was built for publication: Improving fast mutual exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348848)
