ACM Home Page
Please provide us with feedback. Feedback
Cache management algorithms for flexible filesystems
Full text PdfPdf (612 KB)
Source ACM SIGMETRICS Performance Evaluation Review archive
Volume 21 ,  Issue 2  (December 1993) table of contents
Pages: 16 - 25  
Year of Publication: 1993
ISSN:0163-5999
Author
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 22,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Cache management in flexible filesystems deals with the problem of determining a cached file to be replaced when the local cachespace is exhausted. In analogy to virtual memory management, several different algorithms exist for managing cached files. In this paper we simulate the behavior of First-In-First-Out (FIFO), Least Recently Used (LRU), Least Frequently Used (LFU) and a variation of LFU we call the File Length Algorithm (LEN) from the viewpoint of file access times, cache hit ratios and availability. The results of several simulation runs are presented and interpreted.


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.

1
2
 
3
4
5
 
6
Maffeis, S. Resim - A REplication SIMulator. CS Dept. University of Zurich, Internal Report, Jan. 1992.
7
 
8
 
9
Presotto, D., Pike, R., Thompson, K., and Trickey, H. Plan 9, A Distributed System. In <i>Proceedings of the Spring 1991 EurOpen Conference</i> (May 1991).
 
10
11
12
 
13