A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching

High-performance I/O systems depend on prefetching and caching in order to deliver good performance to applications. These two techniques have generally been considered in isolation, even though there are signicant interactions between them; a block prefetched too early reduces the eectiveness of the cache, while a block cached too long reduces the effectiveness of prefetching. In this paper we study the effects of several combined prefetching and caching strategies for systems with multiple disks. Using disk-accurate tracedriven simulation, we explore the performance characteristics of each of the algorithms in cases in which applications provide full advance knowledge of accesses using hints. Some of the strategies have been published with theoretical performance bounds, and some are components of systems that have been built. One is a new algorithm that combines the desirable characteristics of the others. We ndthat when performance is limited by I/O stalls, aggressive prefetchin...

• Type: Conference
• Year: 1996
• Where: OSDI
• Authors: Tracy Kimbrel, Andrew Tomkins, R. Hugo Patterson, Brian N. Bershad, Pei Cao, Edward W. Felten, Garth A. Gibson, Anna R. Karlin, Kai Li
• Keywords: Disk-accurate Tracedriven Simulation, I/O Stalls, Operating System, OSDI 1996, Performance