Sub-logarithmic Test-and-Set against a Weak Adversary
From MaRDI portal
Publication:3095319
DOI10.1007/978-3-642-24100-0_7zbMath1302.68310OpenAlexW1818190495MaRDI QIDQ3095319
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_7
Related Items (7)
Game-theoretic fairness meets multi-party protocols: the case of leader election ⋮ Tight Bounds for Asynchronous Renaming ⋮ Efficient randomized test-and-set implementations ⋮ Unnamed Item ⋮ Faster randomized consensus with an oblivious adversary ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms ⋮ Concurrent Use of Write-Once Memory
Cites Work
- Tight bounds for asynchronous randomized consensus
- Fast Randomized Test-and-Set and Renaming
- Randomized wait-free concurrent objects (extended abstract)
- Efficient asynchronous consensus with the weak adversary scheduler
- An $O(1)$ RMRs Leader Election Algorithm
- Lower Bounds for Randomized Consensus under a Weak Adversary
- Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
- Laws of order
- Linearizable implementations do not suffice for randomized distributed computation
- Probability and Computing
This page was built for publication: Sub-logarithmic Test-and-Set against a Weak Adversary