Lazy Caching

Abstract

This paper examines cache consistency conditions for multiprocessor shared memory systems. It states and motivates a weaker condition than is normally implemented. An algorithm is presented that exploits the weaker condition to achieve greater concurrency. The algorithm is shown to satisfy the weak consistency condition. Other properties of the algorithm… (More)
DOI: 10.1145/151646.151651

Topics

1 Figure or Table

Cite this paper

@article{Afek1993LazyC, title={Lazy Caching}, author={Yehuda Afek and Geoffrey M. Brown and Michael Merritt}, journal={ACM Trans. Program. Lang. Syst.}, year={1993}, volume={15}, pages={182-205} }