The hierarchical daisy architecture for causal delivery
- 1 June 1999
- journal article
- Published by IOP Publishing in Distributed Systems Engineering
- Vol. 6 (2), 71-81
- https://doi.org/10.1088/0967-1846/6/2/302
Abstract
In this paper, we propose the hierarchical daisy architecture, which provides causal delivery of messages sent to any subset of processes. The architecture provides fault tolerance and maintains the amount of control information within a reasonable size. It divides processes into logical groups. Messages inside a logical group are sent directly, while messages that need to cross logical groups' boundaries are forwarded by servers. We prove the correctness of the daisy architecture, discuss possible optimizations, and present simulation results.Keywords
This publication has 10 references indexed in Scilit:
- An Adaptive Causal Ordering Algorithm Suited to Mobile Computing EnvironmentsJournal of Parallel and Distributed Computing, 1997
- The Transis approach to high availability cluster communicationCommunications of the ACM, 1996
- HorusCommunications of the ACM, 1996
- TotemCommunications of the ACM, 1996
- An optimal algorithm for distributed snapshots with causal message orderingInformation Processing Letters, 1994
- Detecting causal relationships in distributed computations: In search of the holy grailDistributed Computing, 1994
- The causal ordering abstraction and a simple way to implement itInformation Processing Letters, 1991
- Lightweight causal and atomic group multicastACM Transactions on Computer Systems, 1991
- Reliable communication in the presence of failuresACM Transactions on Computer Systems, 1987
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978