The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Efficient atomic broadcast using deterministic merge
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Real-time causal message ordering in multimedia systems
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Stabilizing causal deterministic merge
Journal of High Speed Networks - Self-Stabilizing Systems, Part 2
| Hi-index | 0.00 |
We present a causal deterministic merge program for publish-subscribe systems. Our program ensures that if two subscribers receive two messages then they receive them in the same order. Also, it guarantees that the order in which a subscriber receives messages is a linearization of the causal order among those messages. To develop our program, we expect two guarantees from the underlying system: the first guarantee deals with the difference between physical clocks and the second guarantee deals with message delays. While O(n2) space is required for causal delivery of unicast messages in asynchronous systems, our program only uses O(log n) space. We also show how our program can be made stabilizing while using only a bounded space. And, the recovery time for our program is proportional to the guarantees made by the underlying system.