Despite impressive advances in file system throughput resulting from technologies such as high-bandwidth networks and disk arrays, file system latency has not improved and in many cases has become worse. Consequently, file system I/O remains one of the major bottlenecks to operating system performance . This paper investigates an automated predictive approach towards reducing file latency. Automatic Prefetching uses past file accesses to predict future file system requests. The objective is to provide data in advance of the request for the data, effectively masking access latencies. We have designed and implement a system to measure the performance benefits of automatic prefetching. Our current results, obtained from a trace-driven simulation, show that prefetching results in as much as a 280% improvement over LRU especially for smaller caches. Alternatively, prefetching can reduce cache size by up to 50%.
|Title of host publication||USENIX Summer 1994 Technical Conference|
|ISBN (Electronic)||1880446626, 9781880446621|
|State||Published - 1994|
|Event||USENIX Summer 1994 Technical Conference - Boston, United States|
Duration: Jun 6 1994 → Jun 10 1994
|Name||USENIX Summer 1994 Technical Conference|
|Conference||USENIX Summer 1994 Technical Conference|
|Period||6/6/94 → 6/10/94|
Bibliographical noteFunding Information:
This work was supported in part by NSF grant number CCR-9309176
This work was supported in part by NSF grant number CCR-9309176 We would like to thank the reviewers for their helpful comments and suggestions. We would also like to thank Mary Baker for reviewing an early draft of the paper and providing valuable feedback. Finally we would like to thank the DCS users for submitting to being traced.
© 1994 USENIX Association. All rights reserved.
ASJC Scopus subject areas
- Computer Science (all)