Abstract
In a distributed system with N processes, time stamps of size N (such as vector clocks) are necessary to accurately track potential causality between events. Plausible clocks are a family of time-stamping schemes that use smaller time stamps at the expense of some accuracy. To date, all plausible clocks have been designed to use fixed-sized time stamps, and the inaccuracy of these schemes varies from run to run. In this paper, we define a new metric, imprecision, that formally characterizes the fidelity of a plausible clock. We present a new plausible clock system that guarantees an arbitrary constant bound on imprecision. This bound is achieved by allowing time stamps to grow and shrink over the course of the computation. We verify the correctness of our algorithm, present results of a simulation study, and evaluate its performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems 3, 63–75 (1985)
Netzer, R., Xu, J.: Necessary and sufficient conditions for consistent global snapshots. IEEE Transactions on Parallel and Distributed Systems 6, 165–169 (1995)
Elnozahy, M., Alvisi, L., Wang, Y.M., Johnson, D.B.: A survey of rollback-recovery protocols in message passing systems. Technical Report CMU-CS-96-181, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA (1996)
Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: Definitions, implementation, and programming. Distributed Computing 9, 37–49 (1995)
Prakash, R., Raynal, M., Singhal, M.: An adaptive causal ordering algorithm suited to mobile computing environments. Journal of Parallel and Distributed Computing 41, 190–204 (1997)
Fernández, A., Jiménez, E., Cholvi, V.: On the interconnection of causal memory systems. In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 163–170 (2000)
Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM 24, 9–17 (1981)
Maekawa, M.: A \(\sqrt{N}\) algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3, 145–159 (1985)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21, 558–565 (1978)
Fidge, C.J.: Timestamps in message-passing systems that preserve the partial ordering. In: Proc. of the 11th Australian Computer Science Conf., pp. 55–66 (1988)
Mattern, F.: Virtual time and global states of distributed systems. In: Proceedings of the International Workshop on Parallel & Distributed Algorithms, pp. 215–226. Elsevier Science Publishers B. V., Amsterdam (1989)
Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Information Processing Letters 39, 11–16 (1991)
Torres-Rojas, F.J., Ahamad, M.: Plausible clocks: constant size logical clocks for distributed systems. Distributed Computing 12, 179–196 (1999)
Gidenstam, A., Papatriantafilou, M.: Adaptive plausible clocks. In: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), pp. 86–93. IEEE Computer Society, Los Alamitos (2004)
Moore, B.T.: Plausible clocks with bounded inaccuracy. Master’s thesis, The Ohio State University, available as technical report OSU-CISRC-7/05-TR52 (2005)
Baldoni, R., Melideo, G.: k-dependency vectors: A scalable causality-tracking protocol. In: Proceedings of the 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing (2003)
Torres-Rojas, F.J.: Performance evaluation of plausible clocks. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 476–481. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moore, B.T., Sivilotti, P.A.G. (2005). Plausible Clocks with Bounded Inaccuracy. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_17
Download citation
DOI: https://doi.org/10.1007/11561927_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)