Abstract
Techniques such as replication and caching of objects that implement distributed services lead to consistency problems that must be addressed. We explore new consistency protocols based on the notion of object value lifetimes. By keeping track of the lifetimes of the values stored in shared objects (i.e., the time interval that goes from the writing of a value until the latest time when this value is known to be valid), it is possible to check the mutual consistency of a set of related objects cached at a site. Initially, this technique is presented assuming the presence of physical clocks. Later, these clocks are replaced by vector clocks and then by plausible clocks. Lifetimes based on such clocks result in weaker consistency but do provide more efficient implementations.
This work was supported in part by an INRIA/NSF grant and by NSF grant CDA-9501637 and CCR-9619371.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ahamad, M. Ammar and S. Y. Cheung, “Replicated Data Management in Distributed Systems”, in Advances in Distributed Computing: Concepts and Design, IEEE Computer Society Press, T.L. Casavant and M. Singhal eds., 1993.
M. Ahamad, F. Torres-Rojas, R. Kordale, J. Singh, S. Smith, “Detecting Mutual Consistency of Shared Objects”. Proc. of Intl. Workshop on Mobile Systems and Appl., 1994.
M. Ahamad, G. Neiger, J. Burns, P. Kohli and P. Hutto. “Causal memory: definitions, implementation, and programming”. Distributed Computing. September 1995.
M. Ahamad, S. Bhola, R. Kordale, F. Torres-Rojas. “Scalable Information Sharing in Large Scale Distributed Systems”. Proc. of the Seventh SIGOPS Workshop, August 1996.
M. Ahamad, M.Raynal, and G. Thiakime, “An adaptive architecture for causally consistent services”. Proc. of the 18th IEEE Int. Conf. on Distributed Computer Systems (ICDCS98), pp. 86–95, Amsterdam, 1998.
B. Charron-Bost, “Concerning the size of logical clocks in Distributed Systems”, Information Processing Letters 39, pp. 11–16. 1991.
C.J. Fidge, “Timestamps in message-passing systems that preserve the partial ordering”, Proc. 11th Australian Comp.Science Conference, Univ. of Queensland, pp. 55–66, 1988.
C.J. Fidge, “Logical Time in Distributed Computing Systems”, Computer, vol 24, No. 8, pages 28–33, August 1991.
C.J. Fidge, “Fundamentals of Distributed Systems Observation”, IEEE Software, vol 13, No. 6, November 1996.
U. Friztke, P. Ingels, A. Mostefaoui and M. Raynal, “Fault-Tolerant Total Order Multicast to Asynchronous Groups”, Proc. 17th IEEE Symposium on Reliable Distributed Systems (SRDS98), Purdue, October 1998.
R. John and M. Ahamad, “Evaluation of Causal Distributed Shared Memory for Data-racefree Programs”, Tech. Report, College of Computing, Georgia Institute of Technology, 1991.
R. Kordale and M. Ahamad. “A Scalable Technique for Implementing Multiple Consistency Levels for Distributed Objects”. Proc. of the 16th. International Conference in Distributed Computing Systems. May 1996.
R. Kordale. “System Support for Scalable Services”. Ph.D. dissertation, College of Computing, Georgia Institute of Technology. January 1997.
L. Lamport, “Time, clocks and the ordering of events in a Distributed System”, Communications of the ACM, vol 21, pp. 558–564, July 1978.
L. Lamport, “How to make a multiprocessor computer that correctly executes multiprocess programs”, IEEE Transactions on Computers, C-28(9), 690–691, 1979.
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.
M. Raynal and A. Schiper, “From Causal Consistency to Sequential Consistency in Shared Memory Systems”, Proc. 15th Int. Conference FST & TCS (Foundations of Software Technology and Theoretical Computer Science), Springer-Verlag LNCS 1026, pp. 180–194. Bangalore, India, Dec. 1995.
M. Raynal and M. Singhal, “Logical Time: Capturing Causality in Distributed Systems”, IEEE Computer, Vol. 29, No. 2, Feb., 1996.
M. Raynal and M. Ahamad, “Exploiting write semantics in implementing Partially Replicated Causal Objects”, Proc. of 6th Euromicro Conference on Parallel and Distributed Systems, pp. 175–164, Madrid, January 1998.
F. Torres-Rojas, “Efficient Time Representation in Distributed Systems”, MSc. Thesis, College of Computing, Georgia Institute of Technology, 1995.
F. Torres-Rojas and Mustaque Ahamad, “Plausible Clocks: Constant Size Logical Clocks for Distributed Systems”, Proc. 10th International Workshop on Distributed Algorithms, WDAG'96. Bologna, Italy, October 1996.
F. Torres-Rojas and Mustaque Ahamad. “Computing Minimum and Maximum of Plausible Clocks”, Technical Report, Georgia Institute of Technology, 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Torres-Rojas, F.J., Ahamad, M., Raynal, M. (1998). Lifetime based consistency protocols for distributed objects. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056496
Download citation
DOI: https://doi.org/10.1007/BFb0056496
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65066-9
Online ISBN: 978-3-540-49693-9
eBook Packages: Springer Book Archive