Total order broadcast and multicast algorithms
Top Cited Papers
- 1 December 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 36 (4), 372-421
- https://doi.org/10.1145/1041680.1041682
Abstract
Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance. In short, the primitive ensures that messages sent to a set of processes are, in turn, delivered by all those processes in the same total order.Keywords
This publication has 71 references indexed in Scilit:
- Handling message semantics with Generic Broadcast protocolsDistributed Computing, 2002
- Genuine atomic multicast in asynchronous distributed systemsTheoretical Computer Science, 2001
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- TotemCommunications of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Formal specification and compositional verification of an atomic broadcast protocolReal-Time Systems, 1995
- Replica determinism in distributed real-time systems: A brief surveyReal-Time Systems, 1994
- A fault-tolerant protocol for atomic broadcastIEEE Transactions on Parallel and Distributed Systems, 1990
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- On interprocess communicationDistributed Computing, 1986