A modular approach to shared-memory consensus, with applications to the probabilistic-write model
From MaRDI portal
Publication:1938364
DOI10.1007/s00446-011-0134-8zbMath1259.68015OpenAlexW2031281709MaRDI QIDQ1938364
Publication date: 4 February 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0134-8
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)
Related Items
Locality and checkability in wait-free computing ⋮ Faster randomized consensus with an oblivious adversary
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
- Round-by-round fault detectors (extended abstract)
- Approximate shared-memory counting despite a strong adversary
- Randomized consensus in expected O(n log n) individual work
- Polylog randomized wait-free consensus
- Real-time object sharing with minimal system support
- Wait-free synchronization in multiprogrammed systems
- Fast randomized consensus using shared memory
- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Time- and Space-Efficient Randomized Consensus
- Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
- Fast deterministic consensus in a noisy environment
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- Randomized wait-free concurrent objects (extended abstract)
- Efficient asynchronous consensus with the weak adversary scheduler
- Lower Bounds for Randomized Consensus under a Weak Adversary
- On generalized graphs
