Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Local area networks: a client/server approach
Local area networks: a client/server approach
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
A Causal-Phase Ordering Protocol with Multi-Initiators for Overlapped Broadcast
LCN '99 Proceedings of the 24th Annual IEEE Conference on Local Computer Networks
Synchronous, asynchronous, and causally ordered communication
Distributed Computing
| Hi-index | 0.00 |
The virtual synchrony has received a lot of attention in the literature due to it's importance for distributed applications. Most of algorithms that determine global states cut program's execution without taking account of messages groups. The processes exchange messages without a particular ordering inside each phase. But messages of two successive phases must be ordered according to the causal relation. The paper presents the concept of causal-phase and an algorithm, which guarantees that the change of phase of a distributed system is safely performed, i.e., that the causal ordering of the messages events is being respected. In contrast to previous approaches, our protocol is able to handle the multi-initiator case where the change of phase is simultaneously requested by several sub-processes without requiring any kind of master process. This special scheduling establishes a synchronization between two distinct phases that may overlap, while preserving the asynchrony of the communications, without blocking the processes.