Bounds on shared memory for mutual exclusion
From MaRDI portal
Recommendations
- Mutual exclusion in fully anonymous shared memory systems
- Shared-memory mutual exclusion: major research trends since 1986
- scientific article; zbMATH DE number 1696665
- scientific article; zbMATH DE number 2013833
- Tight bounds for shared memory systems accessed by Byzantine processes
- Lower Bounds for Randomized Mutual Exclusion
- Practical constructive schemes for deterministic shared-memory access
- scientific article; zbMATH DE number 2089981
- A Deadlock-Free Semantics for Shared Memory Concurrency
Cited in
(38)- On the cost of uniform protocols whose memory consumption is adaptive to interval contention
- On the mutual-exclusion problem -- a quest for minimal solutions
- Heuristic determination of resolving controls for exact and approximate controllability of nonlinear dynamic systems
- The cost of concurrent, low-contention Read \& Modify \& Write
- Computing in totally anonymous asynchronous shared memory systems
- Active disk Paxos with infinitely many processes
- Recoverable mutual exclusion
- Space lower bounds for the signal detection problem
- Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems
- A visit to mutual exclusion in seven dates
- Tight space bounds for \(\ell\)-exclusion
- Bounded memory protocols
- On the inherent weakness of conditional primitives
- Lower and upper bounds for single-scanner snapshot implementations
- scientific article; zbMATH DE number 1696665 (Why is no real title available?)
- Resilience of mutual exclusion algorithms to transient memory faults
- Tight space bounds for -exclusion
- Progress-space tradeoffs in single-writer memory implementations
- The space complexity of unbounded timestamps
- Minimal Threshold Separators and Memory Requirements for Synchronization
- Computing with infinitely many processes
- A time complexity lower bound for adaptive mutual exclusion
- scientific article; zbMATH DE number 2086790 (Why is no real title available?)
- Linear space bootstrap communication schemes
- scientific article; zbMATH DE number 1435948 (Why is no real title available?)
- A tight space bound for consensus
- Allocate-on-use space complexity of shared-memory algorithms
- Fast timing-based algorithms
- Shared-memory mutual exclusion: major research trends since 1986
- Hundreds of impossibility results for distributed computing
- Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
- An \({\Omega}(n\log n)\) lower bound on the cost of mutual exclusion
- Model Checking-Based Genetic Programming with an Application to Mutual Exclusion
- A closer look at fault tolerance
- Revisionist simulations: a new approach to proving space lower bounds
- The space complexity of consensus from swap
- Just verification of mutual exclusion algorithms
- Light-weight leases for storage-centric coordination
This page was built for publication: Bounds on shared memory for mutual exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317423)
