Evaluation of the Optimal Causal Message Ordering Algorithm

Authors:
Pranav Gambhire;Ajay D. Kshemkalyani
Affiliations:
-;-
Venue:
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Year:
2000

Citing 7
Cited 0

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
A New Algorithm to Implement Causal Ordering

Proceedings of the 3rd International Workshop on Distributed Algorithms
Necessary and sufficient conditions on information for causal message ordering and their optimal implementation

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An optimal causal message ordering algorithm was recently proposed by Kshemkalyani and Singhal, and its optimality was proved theoretically. For a system of n processes, although the space complexity of this algorithm was shown to be O(n2) integers, it was expected that the actual space overhead would be much less than n2. In this paper, we determine the overhead 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 overhead and log space overhead than the canonical Raynal-Schiper-Toueg algorithm.