|
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
|
J. Howard , M. Kazar , S. Menees , D. Nichols , M. Satyanarayanan , Robert N. Sidebotham , M. West, Scale and performance in a distributed file system, ACM SIGOPS Operating Systems Review, v.21 n.5, p.1-2, Nov. 1987
|
| |
13
|
|
|