Plausible clocks: Constant size logical clocks for distributed systems

Distributed Computing

Volumn 12, Issue 4, 1999, Pages 179-195

  Torres Rojas, Francisco J ^a,b,c   Ahamad, Mustaque ^a,d  

^a Georgia Institute of Technology   (United States)

^b Universidad de Costa Rica ^*

^c UNIVERSIDAD DE COSTA RICA   (Costa Rica)

^d STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGICAL CLOCKS; PLAUSIBLE CLOCKS;

ALGORITHMS; COMPUTER SIMULATION; VECTORS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033321246     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050065     Document Type: Article

References (30)

1. M. Ahamad, M. Raynal, G. Thiakime: An adaptive architecture for causally consistent services. Proc. of 18th International Conference on Distributed Computing Systems, ICDCS'98, Amsterdam. 1998
2. M. Ahamad, P. Hutto, R. John: Implementing and Programming Causal Distributed Shared Memory, Proc. of 11th International Conference on Distributed Computing Systems, 1991
3. M. Ahuja, T. Carlson, A. Gahlot: Passive-space and Time View: Vector Clocks for Achieving Higher Performance, Program Correction, and Distributed Computing, IEEE Transactions on Software Engineering, Vol 19, No. 9, September 1993
4. K. Birman, A. Schiper, P. Stephenson: Lightweight Causal and Atomic Group Multicast, ACM Trans Comput Syst 9(3) 272-314 (1991)
5. B. Charron-Bost: Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory, Proc. Int. Workshop on Parallel and Distributed Algorithms, Nice, France, pp 45-56, 1989
6. B. Charron-Bost: Concerning the size of logical clocks in Distributed Systems, Inform Process Lett 39: 11-16 (1991)
7. D.R. Cheriton, D. Skeen: Understanding the Limitations of Causally and Totally Ordered Communications, Operating Systems Review, Vol 27, No. 5, December 1993
8. B.A. Davey, H.A. Priestley: Introduction to Lattices and Order, Cambridge University Press, 1990
9. C. Diehl, C. Jard: Interval approximations of message causality in distributed executions, Proc. Symposium on Theoretical Aspects of Computer Science, Cachan, France, pp 363-374, February 1992
10. C.J. Fidge: Timestamps in message-passing systems that preserve the partial ordering, Proc. 11th Australian Computer Science Conference, University of Queensland, pp 55-66, 1988
11. C.J. Fidge: Logical Time in Distributed Computing Systems, Computer 24(8) 28-33 (1991)
12. C.J. Fidge: Fundamentals of Distributed System Observation, IEEE Software, Vol 13, No. 6, November 1996
13. J. Fowler, W. Zwaenepoel: Causal distributed breakpoints, Proc. of 10th Int'l. Conf. on Distributed Computing Systems, pp 134-141, 1990
14. D. Haban, W. Weigel: Global Events and Global Breakpoints in Distributed Systems, Proc. 21st Hawaii International Conference on Systems Sciences, January 1988
15. A. Israeli, M. Li: Bounded Time-stamps, Proceedings of Twenty-eighth Annual Symposium on Foundations of Computer Science, pp 371-382, 1987
16. R. John, M. Ahamad: Evaluation of Causal Distributed Shared Memory for Data-racefree Programs, Technical Report, College of Computing, Georgia Institute of Technology, 1991
17. R. Kordale, M. Ahamad: A Scalable Technique for Implementing Multiple Consistency Levels for Distributed Objects, Proceedings of the 16th International Conference on Distributed Computing Systems, May 1996
18. L. Lamport: Time, clocks and the ordering of events in a Distributed System, Communications of the ACM, Vol 21, pp 558-564, July 1978
19. 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, North-Holland: Elsevier, pp 215-226, 1988
20. S. Meldal, S. Sankar, J. Vera: Exploiting locality in maintaining potential causality. Proc. 10th Annual ACM Symposium on Principles of Distributed Computing, Montreal, Canada, pp 231-239, 1991
21. M. Raynal: About Logical Clocks for Distributed System, Operating Systems Review, Vol.26, No. 1, January 1992
22. M. Raynal, M. Singhal: Logical Time: Capturing Causality in Distributed Systems, IEEE Computer, Vol. 29, No. 2, 1996
23. A.K. Singh: Bounded Timestamps in Process Networks, Department of Computer Science, University of California at Santa Barbara, June 1992
24. M. Singhal, A. Kshemkalyani: An efficient implementation of vector clocks, Inf. Process Lett. 43: 47-52 (1992)
25. R. Schwarz, F. Mattern: Detecting causal relationships in distributed computations: in search of the holy grail, Distrib Comput 7: 149-174 (1994)
26. F. Torres-Rojas: Efficient Time Representation in Distributed Systems, MSc. Thesis, Georgia Institute of Technology, 1995
27. F. Torres-Rojas, M. Ahamad: Plausible Clocks: Constant Size Logical Clocks for Distributed Systems, Proc. 10th International Workshop on Distributed Algorithms, (WDAG 96). Bologna, Italy, October 1996
28. F. Torres-Rojas, M. Ahamad, M. Raynal, Lifetime Based Consistency Protocols for Distributed Objects, Proc. 12th International Symposium on Distributed Computing, DISC'98, Andros, Greece, September 1998
29. C. Valot: Characterizing the Accuracy of Distributed Timestamps, ACM SIGPLAN Notices, 28 (12), December 1992
30. Z. Yang, T.A. Marsland (eds): Global States and Time in Distributed Systems, IEEE Computer Society Press, 1994