Shared-memory mutual exclusion: major research trends since 1986
From MaRDI portal
Publication:5138486
Recommendations
- Bounds on shared memory for mutual exclusion
- Mutual exclusion in fully anonymous shared memory systems
- A Deadlock-Free Semantics for Shared Memory Concurrency
- Robust simulation of shared memory: 20 years after
- Practical constructive schemes for deterministic shared-memory access
- Characterising and modelling shared memory accesses in multiprocessor programs
Cites work
- scientific article; zbMATH DE number 1696672 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 3601088 (Why is no real title available?)
- scientific article; zbMATH DE number 2006640 (Why is no real title available?)
- A New Approach to Proving the Correctness of Multiprocess Programs
- A fast, scalable mutual exclusion algorithm
- A new fast-path mechanism for mutual exclusion
- A new solution of Dijkstra's concurrent programming problem
- A simple local-spin group mutual exclusion algorithm
- A space- and time-efficient local-spin spin lock.
- Adaptive and efficient mutual exclusion (extended abstract)
- Adaptive solutions to the mutual exclusion problem
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
- Analysis of timing-based mutual exclusion with random times
- Arbitration without common modifiable variables
- Asynchronous group mutual exclusion
- Bounds on shared memory for mutual exclusion
- Contention in shared memory algorithms
- Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
- Improving fast mutual exclusion
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
- Long-lived renaming made fast
- Lower Bounds for Randomized Mutual Exclusion
- Myths about the mutual exclusion problem
- N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable
- Non-blocking timeout in scalable queue-based spin locks
- Nonatomic mutual exclusion with local spinning
- Randomized mutual exclusion algorithms revisited
- Self-stabilizing \(\ell\)-exclusion
- Speeding Lamport's fast mutual exclusion algorithm
- The mutual exclusion problem
- The mutual exclusion problem
- Time/contention trade-offs for multiprocessor synchronization
- Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
- Wait-free algorithms for fast, long-lived renaming
Cited in
(14)- Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems
- Towards a real-time distributed computing model
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Remote memory references at block granularity
- On the inherent weakness of conditional primitives
- A mutual exclusion algorithm with optimally bounded bypasses
- Lower bounds on the amortized time complexity of shared objects
- A visit to mutual exclusion in seven dates
- To compose, or not to compose, that is the question: an analysis of compositional state space generation
- Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
- Reconciling fault-tolerant distributed algorithms and real-time computing
- Recoverable mutual exclusion
- Lower bounds on the amortized time complexity of shared objects
- Bounds on shared memory for mutual exclusion
This page was built for publication: Shared-memory mutual exclusion: major research trends since 1986
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138486)
