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(n 2) integers, it was expected that the actual space overhead would be much less than n 2. 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Amir, D. Dolev, S. Kramer and D. Malki, Transis: A communication sub-system for high-availability, Proceedings of the 22nd International Symposium on Faulttolerant Computing, IEEE Computer Society Press, 337–346, 1991.
K. Birman, T. Joseph, Reliable communication in the presence of failures, ACM Transactions on Computer Systems, 5(1): 47–76, Feb. 1987.
K. Birman, A. Schiper and P. Stephenson, Lightweight causal and atomic group multicast, ACM Transactions on Computer Systems, 9(3): 272–314, Aug. 1991.
M. F. Kaashoek and A. S. Tanenbaum, Group communication in the Ameoba distributed operating system, Proceedings of the Fifth ACM Annual Symposium on Principles of Distributed Computing, 125–136, 1986.
A. Kshemkalyani and M. Singhal, Necessary and sufficient conditions on information for causal message ordering and their optimal implementation, Distributed Computing, 11(2), 91–111, April 1998.
L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, 21(7): 558–565, July 1978.
L. L. Peterson, N. C. Bucholz and R. D. Schlichting, Preserving and using context information in interprocess communication, ACM Transactions on Computer Systems, 7(3), 217–246, 1989.
M. Raynal, A. Schiper, S. Toueg, The causal ordering abstraction and a simple way to implement it, Information Processing Letters, 39:343–350, 1991.
A. Schiper, A. Eggli, A. Sandoz, A new algorithm to implement causal ordering, Proceedings of the Third International Workshop on Distributed Systems, Nice, France, LNCS 392, Springer-Verlag, 219–232, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gambhire, P., Kshemkalyani, A.D. (2000). Evaluation of the Optimal Causal Message Ordering Algorithm. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-44467-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41429-2
Online ISBN: 978-3-540-44467-1
eBook Packages: Springer Book Archive