Lazy caching

  • Authors:
  • Yehuda Afek;Geoffrey Brown;Michael Merritt

  • Affiliations:
  • AT & T Bell Labs., Murray Hill, NJ;Cornell Univ., Ithaca, NY;AT & T Bell Labs., Murray Hill, NJ

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

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.