Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Proceedings of the 13th International Symposium on Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Optimistic atomic broadcast: a pragmatic viewpoint
Theoretical Computer Science - Special issue: Distributed computing
Low cost consensus-based Atomic Broadcast
PRDC '00 Proceedings of the 2000 Pacific Rim International Symposium on Dependable Computing
An Indulgent Uniform Total Order Algorithm with Optimistic Delivery
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in order of these timestamps. The Ω-elected leader simulates processes it suspects to have crashed (⋄S). For fault-tolerance, it uses a new cheap Generic Broadcast algorithm that requires only a majority of correct processes (n 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps. The main algorithm satisfies several new lower bounds