On the use of registers in achieving wait-free consensus
From MaRDI portal
Publication:5137333
DOI10.1007/s004460050029zbMath1448.68072OpenAlexW2033043901MaRDI QIDQ5137333
Gary L. Peterson, Rida A. Bazzi, Gil Neiger
Publication date: 2 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004460050029
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On interprocess communication. II: Algorithms
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Concurrent Reading While Writing
- Resource bounds and combinations of consensus objects
- On the robustness of Herlihy's hierarchy
- A completeness theorem for a class of synchronization objects
- Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
- A gap theorem for consensus types extended abstract
- Consensus power makes (some) sense! (extended abstract)
This page was built for publication: On the use of registers in achieving wait-free consensus