The concept of causal-phase ordering for overlapped broadcasts
ACM SIGOPS Operating Systems Review
A Causal-Phase Protocol to Order Soft Real-Time Transactions in a Distributed Database
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
| Hi-index | 0.00 |
Distributed applications have often to determine consistent cuts (global states) in order to ensure virtual synchrony between independent tasks. Moreover most of sequential programs can be cut out in more or less independent tasks; we group these tasks into phases to allow an asynchronous computation. 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 were 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.