Abstract
In a Distributed System with N sites, the detection of causal relationships between events can only be done with vector clocks of size N. This gives rise to scalability and efficiency problems for accurate logical clocks. In this paper we propose a class of logical clocks called plausible clocks that can be implemented with a number of components not affected by the size of the system and yet they provide good ordering accuracy. We develop rules to combine plausible clocks to produce more accurate clocks. Several examples of plausible clocks and their combination are presented. Using a simulation model, we evaluate the performance of these clocks.
Preview
Unable to display preview. Download preview PDF.
References
B. Charron-Bost, “Concerning the size of logical clocks in Distributed Systems”, Information Processing Letters 39, pp. 11–16. 1991.
L. Lamport, “Time, clocks and the ordering of events in a Distributed System”, Communications of the ACM, vol 21, pp. 558–564, July 1978.
F. Mattern, “Virtual Time and Global States in Distributed Systems”, Conf. (Cosnard et al (eds) Proc. Workshop on Parallel and Distributed Algorithms, Chateau de Bonas, Elsevier, North Holland, pp. 215–226. October 1988.
S. Meldal, S. Sankar and J. Vera, “Exploiting locality in maintaining potential causality”. Proc. 10th Annual ACM Symposium on Principles of Distributed Computing, Montreal, Canada, pp. 231–239, 1991.
R. Schwarz and F. Mattern, “Detecting causal relationships in distributed computations: in search of the holy grial”, Distributed Computing, Vol. 7, 1994.
M. Singhal, A. Kshemkalyani, “An efficient implementation of vector clocks”, Inf. Process Lett. Vol. 43, pp. 47–52, 1992.
F. Torres-Rojas, “Efficient Time Representation in Distributed Systems”, MSc. Thesis, Georgia Institute of Technology, 1995.
J. Fowler and W. Zwaenepoel, “Causal distributed breakpoints”, Proc. of 10th Int'l. Conf. on Distributed Computing Systems, pp. 134–141, 1990.
M. Raynal and M. Singhal, “Logical Time: Capturing Causality in Distributed Systems”, IEEE Computer, Vol. 29, No. 2, Feb., 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Torres-Rojas, F.J., Ahamad, M. (1996). Plausible clocks: Constant size logical clocks for Distributed Systems. In: Babaoğlu, Ö., Marzullo, K. (eds) Distributed Algorithms. WDAG 1996. Lecture Notes in Computer Science, vol 1151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61769-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-61769-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61769-3
Online ISBN: 978-3-540-70679-3
eBook Packages: Springer Book Archive