Lazy caching
- 1 January 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 15 (1) , 182-205
- https://doi.org/10.1145/151646.151651
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 and possible extensions are discussed.Keywords
This publication has 8 references indexed in Scilit:
- Slow memory: weakening consistency to enhance concurrency in distributed shared memoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient and correct execution of parallel programs that share memoryACM Transactions on Programming Languages and Systems, 1988
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- Axioms for memory access in asynchronous hardware systemsACM Transactions on Programming Languages and Systems, 1986
- Data Coherence Problem in a Multicache SystemIEEE Transactions on Computers, 1985
- Cache MemoriesACM Computing Surveys, 1982
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980
- A New Solution to Coherence Problems in Multicache SystemsIEEE Transactions on Computers, 1978