Efficient atomic broadcast using deterministic merge
- 16 July 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 209-218
- https://doi.org/10.1145/343477.343620
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Fast message ordering and membership using a logical token-passing ringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Lightweight causal and atomic group multicastACM Transactions on Computer Systems, 1991
- Group communication in the Amoeba distributed operating systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- A fault-tolerant protocol for atomic broadcastIEEE Transactions on Parallel and Distributed Systems, 1990
- Preserving and using context information in interprocess communicationACM Transactions on Computer Systems, 1989
- Reliable communication in the presence of failuresACM Transactions on Computer Systems, 1987
- Reliable broadcast protocolsACM Transactions on Computer Systems, 1984
- Discrete Dynamic ProgrammingThe Annals of Mathematical Statistics, 1962