ACM Home Page
Please provide us with feedback. Feedback
Data cache management using frequency-based replacement
Full text PdfPdf (991 KB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems table of contents
Univ. of Colorado, Boulder, Colorado, United States
Pages: 134 - 142  
Year of Publication: 1990
ISBN:0-89791-359-0
Also published in ...
Authors
John T. Robinson  IBM Research Division, T.J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY
Murthy V. Devarakonda  IBM Research Division, T.J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY
Sponsor
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 142,   Citation Count: 72
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/98457.98523
What is a DOI?

ABSTRACT

We propose a new frequency-based replacement algorithm for managing caches used for disk blocks by a file system, database management system, or disk control unit, which we refer to here as data caches. Previously, LRU replacement has usually been used for such caches. We describe a replacement algorithm based on the concept of maintaining reference counts in which locality has been “factored out”. In this algorithm replacement choices are made using a combination of reference frequency and block age. Simulation results based on traces of file system and I/O activity from actual systems show that this algorithm can offer up to 34% performance improvement over LRU replacement, where the improvement is expressed as the fraction of the performance gain achieved between LRU replacement and the theoretically optimal policy in which the reference string must be known in advance. Furthermore, the implementation complexity and efficiency of this algorithm is comparable to one using LRU replacement.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BOZM89
 
COFF73
 
DEVA88
 
DEVA90
Devarakonda, M. Analysis of file cache replacement algorithms using UNIX traces, Res. report RC15410, IBM Research Div., T. J. Watson Res. Ctr., Yorktown Hts., NY, 1990.
EFFE84
OUST85
SMIT82
SMIT85

CITED BY  72

Collaborative Colleagues:
John T. Robinson: colleagues
Murthy V. Devarakonda: colleagues