Skip to main content

Analyzing Convergence in Consistency Models for Distributed Objects

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3544)

Abstract

At instant t, two or more sites could perceive different values for the same distributed object X. However, depending on the consistency protocol used, it might be expected that, after a while, every site in the system should see the same value for this object. In this paper, we present a formalization of the concept of convergence and analyze its relationships with several consistency models. Among other things, we claim that, by itself, sequential consistency is not a convergent protocol.

Keywords

  • Partial Order
  • Consistency Model
  • Absolute Convergence
  • Read Operation
  • Time Consistency

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adve, S., Gharachorloo, K.: Shared Memory Consistency Models: A Tutorial. Western Research Laboratory, Research Report 95/7 (1995)

    Google Scholar 

  2. Ahamad, M., Torres-Rojas, F., Kordale, R., Singh, J., Smith, S.: Detecting Mutual Consistency of Shared Objects. In: Proc. of International Workshop on Mobile Systems and Applications (1994)

    Google Scholar 

  3. Ahamad, M., Neiger, G., Burns, J., Kohli., P., Hutto, P.: Causal memory: definitions, implementation and programming. Distributed Computing (September 1995)

    Google Scholar 

  4. Ahamad, M., Bhola, S., Kordale, R., Torres-Rojas, F.: Scalable Information Sharing in Large Scale Distributed Systems. In: Proceedings of the Seventh SIGOPS Workshop (August 1996)

    Google Scholar 

  5. Ahamad, M., Raynal, M., Thiakime, G.: An adaptive architecture for causally consistent services. In: Proc. ICDCS 1998, Amsterdam (1998)

    Google Scholar 

  6. Ahamad, M., Raynal, M.: Ordering and Timeliness: Two Facets of Consistency? Future Directions in Distributed Computing (2003)

    Google Scholar 

  7. Attiya, H., Welch, J.J.: Sequential Consistency vs. Linearizability. ACM Transactions on Computer Systems 12(1) (May 1994)

    Google Scholar 

  8. Birman, K., Schiper, A., Stephenson, P.: Lightweight Causal and Atomic Group Multicast. ACM Transactions on Computer Systems 9(3), 272–314 (1991)

    CrossRef  Google Scholar 

  9. Ellis, C.A., Gibbs, S.J.: Concurrency Control in Groupware Systems. In: ACM SIGMOD 1989 proceedings, pp. 399–407 (1989)

    Google Scholar 

  10. Guerraoui, R., Hari, C.: On the Consistency Problem in Mobile Distributed Computing. In: ACM POMC (2002)

    Google Scholar 

  11. Herlihy, M., Wing, J.: Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems 12(3) (July 1990)

    Google Scholar 

  12. Kordale, R., Ahamad, M.: A Scalable Technique for Implementing Multiple Consistency Levels for Distributed Objects. In: Proceedings of the 16th. International Conference in Distributed Computing Systems (May 1996)

    Google Scholar 

  13. Kordale, R.: System Support for Scalable Services, Ph.D. dissertation, College of Computing, Georgia Institute of Technology (January 1997)

    Google Scholar 

  14. Lamport, L.: Time, Clocks and the Ordering of Events is a Distributed System. Communications of the ACM 21(7), 558–565 (1978)

    CrossRef  Google Scholar 

  15. Lamport, L.: How to make a Multiprocessor Computer that correctly executes Multiprocess Programs. IEEE Transactions on Computer Systems C-28(9) (1979)

    Google Scholar 

  16. Mattern, F.: Virtual Time and Global States of Distributed Systems. In: Proceedings of the International Workshop on Parallel and Distributed Algorithms, pp. 215–226 (1989)

    Google Scholar 

  17. Raynal, M., Schiper, A.: From Causal Consistency to Sequential Consistency in Shared Memory Systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 180–194. Springer, Heidelberg (1995)

    CrossRef  Google Scholar 

  18. Sun, C., et al.: Achieving convergence, causality-preservation, and intention-preservation in real-time cooperative editing systems. ACM Transactions in Computer-Human Interaction 5(1), 63–108 (1998)

    CrossRef  Google Scholar 

  19. Torres-Rojas, F.J., Ahamad, M., Raynal, M.: Lifetime Based Consistency Protocols for Distributed Objects. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 378–392. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  20. Torres-Rojas, F.J., Ahamad, M., Raynal, M.: Timed Consistency for Shared Distributed Objects. In: Annual ACM Symposium on Principles of Distributed Computing PODC 1999, Atlanta, Georgia (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Torres-Rojas, F.J., Meneses, E. (2005). Analyzing Convergence in Consistency Models for Distributed Objects. In: Higashino, T. (eds) Principles of Distributed Systems. OPODIS 2004. Lecture Notes in Computer Science, vol 3544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11516798_25

Download citation

  • DOI: https://doi.org/10.1007/11516798_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27324-0

  • Online ISBN: 978-3-540-31584-1

  • eBook Packages: Computer ScienceComputer Science (R0)