Time and Communication Efficient Consensus for Crash Failures
From MaRDI portal
Publication:3524314
DOI10.1007/11864219_22zbMATH Open1155.68328OpenAlexW1505927490MaRDI QIDQ3524314FDOQ3524314
Authors: Bogdan S. Chlebus, Dariusz R. Kowalski 
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11864219_22
Recommendations
Cited In (19)
- Timeliness, failure-detectors, and consensus performance
- Reliable Timeout Based Commit Protocol
- Gossiping by processors prone to omission failures
- Fast scalable deterministic consensus for crash failures
- Early-deciding consensus is expensive
- On the Message Complexity of Indulgent Consensus
- Adaptive timeliness of consensus in presence of crash and timing faults
- Fast agreement in networks with Byzantine nodes
- Reaching consensus in the presence of contention-related crash failures
- Efficient gossip and robust distributed computation
- Communication complexity of consensus in anonymous message passing systems
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- Efficient gossip and robust distributed computation
- Communication-efficient and crash-quiescent omega with unknown membership
- Communication-efficient randomized consensus
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Confidential gossip
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip
- Doing-it-all with bounded work and communication
This page was built for publication: Time and Communication Efficient Consensus for Crash Failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524314)
