Alternative formulations of the paging problem for cache with read through

  • Authors:

  • Cathy Jo Linn

  • Affiliations:

  • Vanderbilt UnLversity, Nashville, Tennessee

  • Venue:
  • ACM-SE 17 Proceedings of the 17th annual Southeast regional conference
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cache memory is now widely accepted as a cost effective way of improving system performance. Significant reductions in the average data access time have been achieved using very simplistic paging algorithms, such as LRU, implemented in hardware. In this paper we wish to investigate more sophisticated algorithms for the management of intelligent cache systems.