Sequential consistency and the lazy caching algorithm

Authors:
Rob Gerth
Affiliations:
Intel Microprocessor Products Group, Strategic CAD Laboratories (SCL), 5200 NE Elam Young Parkway, JFT-104, Hillsboro, OR
Venue:
Distributed Computing - Special issue: Verification of lazy caching
Year:
1999

Citing 3
Cited 6

The Stanford Dash Multiprocessor

Computer
Lazy caching

ACM Transactions on Programming Languages and Systems (TOPLAS)
Memory consistency models

ACM SIGOPS Operating Systems Review

Extending Memory Consistency of Finite Prefixes to Infinite Computations

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Using Timestamping and History Variables to Verify Sequential Consistency

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Characterization of a sequentially consistent memory and verification of a cache memory by abstraction

Distributed Computing - Special issue: Verification of lazy caching
Using CSP to verify sequential consistency

Distributed Computing - Special issue: Verification of lazy caching
Proving refinement using transduction

Distributed Computing - Special issue: Verification of lazy caching
Lazy caching in TLA

Distributed Computing - Special issue: Verification of lazy caching

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.