Skip to main content

Allowing Atomic Objects to Coexist with Sequentially Consistent Objects

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

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

Included in the following conference series:

  • 496 Accesses

Abstract

A concurrent object is an object that can be concurrently accessed by several processes. Two well known consistency criteria for such objects are atomic consistency (also called linearizability) and sequential consistency. Both criteria require that all the operations on all the concurrent objects be totally ordered in such a way that each read operation obtains the last value written into the corresponding object. They differ in the meaning of the word ”last” that refers to physical time for atomic consistency, and to logical time for sequential consistency. This paper investigates the merging of these consistency criteria. It presents a protocol that allows the upper layer multiprocess program to use simultaneously both types of consistency: purely atomic objects can coexist with purely sequentially consistent objects. The protocol is built on top of a message passing asynchronous distributed system. Interestingly, this protocol is generic in the sense that it can be tailored to provide only one of these consistency criteria.  

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adve, S.V., Garachorloo, K.: Shared Memory Models: a Tutorial. IEEE Computer 29(12), 66–77 (1997)

    Google Scholar 

  2. Afek, Y., Brown, G., Merritt, M.: Lazy Caching. ACM Transactions on Programming Languages and Systems 15(1), 182–205 (1993)

    Article  Google Scholar 

  3. Ahamad, M., Hutto, P.W., Neiger, G., Burns, J.E., Kohli, P.: Causal memory: Definitions, Implementations and Programming. Distributed Comp. 9, 37–49 (1995)

    Article  MathSciNet  Google Scholar 

  4. Ahamad, M., Kordale, R.: Scalable Consistency Protocols for Distributed Services. IEEE Transactions on Parallel and Distributed Systems 10(9), 888–903 (1999)

    Article  Google Scholar 

  5. Ahamad, M., Raynal, M., Thia-Kime, G.: An Adaptive Protocol for Implementing Causally Consistent Distributed Services. In: Proc. 18th IEEE Int. Conf. on Distributed Computing Systems, pp. 86–93. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  6. Attiya, H., Welch, J.L.: Sequential Consistency versus Linearizability. ACM Transactions on Computer Systems 12(2), 91–122 (1994)

    Article  Google Scholar 

  7. Garg, V.K., Raynal, M.: Normality: a Correctness Condition for Concurrent Objects. Parallel Processing Letters 9(1), 123–134 (1999)

    Article  Google Scholar 

  8. Herlihy, M.P., Wing, J.L.: Linearizability: a Correctness Condition for Concurrent Objects. ACM TOPLAS 12(3), 463–492 (1990)

    Article  Google Scholar 

  9. Ibaraki, T., Kameda, T., Minoura, T.: Serializability with Constraints. ACM Transactions on Database Systems 12(3), 429–452 (1987)

    Article  MathSciNet  Google Scholar 

  10. Lamport, L.: How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs. IEEE Transactions on Computers C28(9), 690–691 (1979)

    Article  Google Scholar 

  11. Li, K., Hudak, P.: Memory Coherence in Shared Virtual Memory Systems. ACM Transactions on Computer Systems 7(4), 321–359 (1989)

    Article  Google Scholar 

  12. Mizuno, M., Nielsen, M.L., Raynal, M.: An Optimistic Protocol for a Linearizable Distributed Shared Memory System. Parallel Proc. Letters 6(2), 265–278 (1996)

    Article  Google Scholar 

  13. Mizuno, M., Raynal, M., Zhou, J.Z.: Sequential Consistency in Distributed Systems. In: Birman, K.P., Mattern, F., Schiper, A. (eds.) Dagstuhl Seminar 1994. LNCS, vol. 938, pp. 224–241. Springer, Heidelberg (1995)

    Google Scholar 

  14. Papadimitriou, C.: The Theory of Concurrency Control. Comp. Science Press (1986)

    Google Scholar 

  15. Raynal, M.: Sequential Consistency as Lazy Linearizability. In: 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pp. 151–152 (2002)

    Google Scholar 

  16. Raynal, M.: Token-Based Sequential Consistency. Journal of Computer Systems Science and Engineering 17(6), 359–365 (2002)

    MathSciNet  Google Scholar 

  17. Raynal, M., Roy, M., Tutu, C.: A simple Protocol Offering Both Atomic Read Operations and Sequentially Consistent Read operations. In: Proc. 19th Int. Conference on Advanced Information Networking and Applications (AINA 2005). IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Raynal, M., Schiper, A.: A Suite of Formal Definitions for Consistency Criteria in Distributed Shared Memories. In: Proc. 9th Int. IEEE Conference on Parallel and Distributed Computing Systems (PDCS 1996), pp. 125–131 (1996)

    Google Scholar 

  20. Raynal, M., Vidyasankar, K.: A Distributed Implementation of Sequential Consistency with Multi-Object Operations. In: 24th IEEE Int. Conf. on Distributed Computing Systems (ICDCS 2004), pp. 544–551. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  21. Taylor, R.N.: Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Informatica 19, 57–84 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zhan, Z., Ahamad, M., Raynal, M.: Mixed Consistency Model: Meeting Data Sharing Needs of Heterogeneous Users. In: Proc. 25th IEEE Int. Conference on Distributed Computing Systems (ICDCS 2005). IEEE Computer Society Press, Los Alamitos (2005)

    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

Raynal, M., Roy, M. (2005). Allowing Atomic Objects to Coexist with Sequentially Consistent Objects. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_6

Download citation

  • DOI: https://doi.org/10.1007/11535294_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics