The Community for Technology Leaders
Proceedings of 37th Conference on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 540
T. Kimbrel , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
A.R. Karlin , Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
ABSTRACT
The authors consider algorithms for integrated prefetching and caching in a model with a fixed-size cache and any number of backing storage devices (disks). Previously, the single disk case was considered by Cao et al. (1995). They show that the natural extension of their aggressive algorithm to the parallel disk case is suboptimal by a factor near the number of disks in the worst case. The main result is a new algorithm, reverse aggressive, with near-optimal performance in the presence of multiple disks.
INDEX TERMS
magnetic disc storage; algorithms; near-optimal parallel prefetching/caching; integrated prefetching/caching; fixed-size cache; model; backing storage devices; parallel disk case; reverse aggressive algorithm; near-optimal performance; multiple disks
CITATION

A. Karlin and T. Kimbrel, "Near-optimal parallel prefetching and caching," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 540.
doi:10.1109/SFCS.1996.548513
88 ms
(Ver 3.3 (11022016))