The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—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 <tmath>n</tmath> processes, although the space complexity of this algorithm was shown to be <tmath>O(n^2)</tmath> integers, it was expected that the actual space overhead would be much less than <tmath>n^2</tmath>. 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.</p>
INDEX TERMS
Causal multicast, causal ordering, distributed system, performance, simulation.
CITATION
Ajay D. Kshemkalyani, Pranav Gambhire, Punit Chandra, "Performance of the Optimal Causal Multicast Algorithm: A Statistical Analysis", IEEE Transactions on Parallel & Distributed Systems, vol. 15, no. , pp. 40-52, January 2004, doi:10.1109/TPDS.2004.1264784
104 ms
(Ver 3.1 (10032016))