On the space complexity of randomized synchronization
From MaRDI portal
Recommendations
- On the inherent weakness of conditional synchronization primitives
- Time and Space Lower Bounds for Nonblocking Implementations
- Optimal Time–Space Tradeoff for Shared Memory Leader Election
- On the inherent weakness of conditional primitives
- A complexity-based hierarchy for multiprocessor synchronization (extended abstract)
Cited in
(21)- On the uncontended complexity of anonymous agreement
- Computing in totally anonymous asynchronous shared memory systems
- RMR-efficient implementations of comparison primitives using read and write operations
- Tight bounds for shared memory systems accessed by Byzantine processes
- A complexity-based classification for multiprocessor synchronization
- Communication-efficient randomized consensus
- Lower and upper bounds for single-scanner snapshot implementations
- Lower bounds for restricted-use objects
- Test-and-set in optimal space
- The space complexity of unbounded timestamps
- Optimal Time–Space Tradeoff for Shared Memory Leader Election
- Linear space bootstrap communication schemes
- Tight bounds for adopt-commit objects
- A tight space bound for consensus
- Hundreds of impossibility results for distributed computing
- A complexity-based hierarchy for multiprocessor synchronization (extended abstract)
- Universal constructions that ensure disjoint-access parallelism and wait-freedom
- Revisionist simulations: a new approach to proving space lower bounds
- The complexity of updating snapshot objects
- Optimal resilience in systems that mix shared memory and message passing
- The space complexity of consensus from swap
This page was built for publication: On the space complexity of randomized synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158522)
