On the complexity of basic abstractions to implement consensus
From MaRDI portal
Publication:683759
DOI10.1016/j.tcs.2017.12.039zbMath1387.68170OpenAlexW2783052927MaRDI QIDQ683759
Claire Capdevielle, Colette Johnen, Alessia Milani
Publication date: 9 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.039
complexitydistributed computingshared memoryconsensuswait-freedomadopt-commitconflict-detectorgrafariusvalue-splitter
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Cites Work
- Tight bounds for adopt-commit objects
- On the uncontended complexity of anonymous agreement
- Wait-free algorithms for fast, long-lived renaming
- Round-by-round fault detectors (extended abstract)
- The complexity of obstruction-free implementations
- Impossibility of distributed consensus with one faulty process
- Unreliable failure detectors for reliable distributed systems
- Randomized protocols for asynchronous consensus
- Long-lived renaming made fast
- A Practical Distributed Universal Construction with Unknown Participants
This page was built for publication: On the complexity of basic abstractions to implement consensus