Skip to main content
SpringerLink
Log in

Sequential consistency and the lazy caching algorithm

  • Original articles
  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary.

I introduce and discuss sequential consistency, a relaxed memory model, and define what it means for a protocol to implement sequential consistency. Then, I introduce the lazy caching protocol of Afek, Brown and Merrit [ABM93] and formalize it as a labeled transition system.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Intel Microprocessor Products Group, Strategic CAD Laboratories (SCL), 5200 NE Elam Young Parkway, JFT-104, Hillsboro, OR 97124-6497, USA (e-mail: robgerth@ichips.intel.com) , , , , , , US

    Rob Gerth

Authors
  1. Rob Gerth
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gerth, R. Sequential consistency and the lazy caching algorithm. Distrib Comput 12, 57–59 (1999). https://doi.org/10.1007/s004460050057

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460050057

Search

Navigation