The performance impact of kernel prefetching on buffer cache replacement algorithms
Open Access
- 6 June 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 33 (1) , 157-168
Abstract
A fundamental challenge in improving the file system performance is to design effective block replacement algorithms to minimize buffer cache misses. Despite the well-known interactions between prefetching and caching, almost all buffer cache replacement algorithms have been proposed and studied comparatively without taking into account file system prefetching which exists in all modern operating systems. This paper shows that such kernel prefetching can have a significant impact on the relative performance in terms of the number of actual disk I/Os of many well-known replacement algorithms; it can not only narrow the performance gap but also change the relative performance benefits of different algorithms. These results demonstrate the importance for buffer caching research to take file system prefetching into consideration.Keywords
This publication has 24 references indexed in Scilit:
- Integrated prefetching and caching in single and parallel disk systems2003
- LIRS2002
- Optimal prefetching and caching for parallel I/O sytems2001
- Compiler-based I/O prefetching for out-of-core applicationsACM Transactions on Computer Systems, 2001
- Towards application/file-level characterization of block references2000
- Adaptive page replacement based on memory reference behavior1997
- Implementation and performance of integrated application-controlled file caching, prefetching, and disk schedulingACM Transactions on Computer Systems, 1996
- A study of integrated prefetching and caching strategies1995
- WSCLOCK---a simple and effective algorithm for virtual memory management1981
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966