Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Newtop: a fault-tolerant group communication protocol
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Proceedings of the 2008 Spring simulation multiconference
Performance of fair distributed mutual exclusion algorithms
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
Abstract--An optimal causal message ordering algorithm for asynchronous distributed systems was proposed by Kshemkalyani and Singhal and its optimality was proven theoretically. For a system of n processes, although the space complexity of this algorithm was shown to be O(n^2) integers, it was expected that the actual space overhead would be much less than n^2. It is difficult to determine the behavior of this algorithm by a theoretical analysis. In this paper, we measure the overheads of two different implementations of the optimal causal message ordering algorithm via simulation under a wide range of system conditions. The optimal algorithm is seen to display significantly less message space overhead and log space overhead than the canonical Raynal-Schiper-Toueg algorithm.