Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
An efficient reliable broadcast protocol
ACM SIGOPS Operating Systems Review
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Fast Causal Multicast
ActorSpace: an open distributed programming paradigm
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.00 |
We begin by outlining a new protocol that efficiently implements a reliable, causally ordered multicast primitive and is easily extended into a totally ordered one. Since measurements show that the dominant cost of this protocol is message transport, the design of a lower level multicast transport protocol is discussed. The overall scheme scales with bounded overhead. Our first conclusion is that systems such as Isis can achieve performance competitive with the best existing multicast facilities - a finding contradicting the widespread concern that fault-tolerance may be unacceptably costly. Our second conclusion is that the paradigm of multicast transport is extremely useful for constructing fault-tolerant applications. Our final conclusion is that the framework for fault-tolerant programming provided by Isis is very useful in the design and construction of these extensions to the basic system.