Skip to main content

Sequential Consistency as Lazy Linearizability

  • Conference paper
  • First Online:
EurAsia-ICT 2002: Information and Communication Technology (EurAsia-ICT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2510))

Included in the following conference series:

  • 393 Accesses

Abstract

This paper shows that actually sequential consistency is a form of “lazy” atomic consistency. More precisely, it proposes a new particularly simple sequential consistency protocol that orders the conflicting operations on each object separately, and appropriately invalidates object copies to prevent consistency violation. When compared to invalidation-based protocols that ensure atomic consistency (such as Li-Hudak’s protocol), the proposed protocol can be seen as using lazy invalidation. Hence, in addition to a new consistency protocol, the paper provides a new insight into the concepts and mechanisms that underlie consistency protocols: while atomic consistency is based on physical time and requires eager invalidation, sequential consistency is based on logical time and needs only lazy invalidation.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Attiya H. and Welch J.L., Sequential Consistency versus Linearizability. ACM Transactions on Computer Systems, 12(2):91–122, 1994.

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. 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 

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

    Article  Google Scholar 

  5. Mizuno M., Raynal M. and Zhou J.Z., Sequential Consistency in Distributed Systems. Springer Verlag LNCS #938, pp. 224–241, Dagsthul (Germany), 1994.

    Google Scholar 

  6. Raynal M., Sequential Consistency as Lazy Linearizabilty. Research Report # 1437, IRISA, Université de Rennes 1 (France), 2002, 13 pages. http://www.irisa.fr/bibli/publi/pi/2002/1437/1437.html.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raynal, M. (2002). Sequential Consistency as Lazy Linearizability. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-36087-5_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics