Lazy cache algorithm

Yehuda Afek, Geoffrey Brown, Michael Merritt

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper examines cache consistency conditions (safety conditions) for multiprocessor shared memory systems. It states and motivates a weaker condition than is normally required. An algorithm is presented that exploits the weaker condition to achieve greater concurrency. The paper concludes with a proof that the algorithm satisfies the safety condition.

Original languageEnglish
Title of host publicationProceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
EditorsF.T. Leighton
PublisherAssociation for Computing Machinery, Inc
Pages209-222
Number of pages14
ISBN (Electronic)089791323X, 9780897913232
DOIs
StatePublished - 1 Mar 1989
Event1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 - Santa Fe, United States
Duration: 18 Jun 198921 Jun 1989

Publication series

NameProceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Conference

Conference1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
Country/TerritoryUnited States
CitySanta Fe
Period18/06/8921/06/89

Fingerprint

Dive into the research topics of 'Lazy cache algorithm'. Together they form a unique fingerprint.

Cite this