A complexity-based classification for multiprocessor synchronization
From MaRDI portal
Recommendations
- A complexity-based hierarchy for multiprocessor synchronization (extended abstract)
- Time/contention trade-offs for multiprocessor synchronization
- Semicomputable points in Euclidean spaces
- Synchronization costs on multiprocessors
- Computational complexity of synchronization under regular commutative constraints
- Algorithms and Computation
Cites work
- A complexity-based hierarchy for multiprocessor synchronization (extended abstract)
- A tight space bound for consensus
- All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
- Anonymous and fault-tolerant shared-memory computing
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
- Atomic snapshots of shared memory
- Determining Consensus Numbers
- Distributed Computing
- Distributed Computing
- Fast randomized consensus using shared memory
- On the space complexity of randomized synchronization
- Polylogarithmic concurrent data structures from monotone circuits
- Revisionist simulations: a new approach to proving space lower bounds
- Robust wait-free hierarchies
- Tight bounds for adopt-commit objects
- Time and Space Lower Bounds for Nonblocking Implementations
Cited in
(2)
This page was built for publication: A complexity-based classification for multiprocessor synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1988522)
