Reaching consensus in the presence of contention-related crash failures
DOI10.1007/978-3-031-21017-4_13zbMath1522.68063OpenAlexW4309371891MaRDI QIDQ6155245
Michel Raynal, Anaïs Durand, Gadi Taubenfeld
Publication date: 12 June 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-21017-4_13
concurrencyconsensus algorithmasynchronous systematomic registerconsensus numberprocess crash failurecontentionparticipating processread/write register\( \lambda \)-constrained failure
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Initial failures in distributed computations
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Unbeatable consensus
- A Layered Analysis of Consensus
- Round-by-round fault detectors (extended abstract)
- Introduction to Reliable and Secure Distributed Programming
- Concurrent Programming: Algorithms, Principles, and Foundations
- Impossibility of distributed consensus with one faulty process
- The part-time parliament
- Indulgent algorithms (preliminary version)
- Fault-Tolerant Message-Passing Distributed Systems
- A closer look at fault tolerance
This page was built for publication: Reaching consensus in the presence of contention-related crash failures
