Optimal Prediction for Prefetching in the Worst Case

Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because of their success in avoiding costly I/Os. Prefetching can be looked upon as a type of online sequential prediction, where the predictions must be accurate as well as made in a computationally efficient way. Unlike other online problems, prefetching cannot admit a competitive analysis, since the optimal offline prefetcher incurs no cost when it knows the future page requests. Previous analytical work on prefetching [J. Assoc. Comput. Mach., 143 (1996), pp. 771

• Type: Conference
• Year: 1994
• Where: SODA
• Authors: P. Krishnan, Jeffrey Scott Vitter
• Keywords: Algorithms, Finite State Prefetchers, Page Request, Page Request Sequence, SODA 1994