Affiliation:
1. Duke Univ., Durham, NC
2. Bell Labs, Holmdel, NJ
Abstract
Caching and prefetching are important mechanisms for speeding up access time to data on secondary storage. Recent work in competitive online algorithms has uncovered several promising new algorithms for caching. In this paper, we apply a form of the competitive philosophy for the first time to the problem of prefetching to develop an optimal universal prefetcher in terms of fault rate, with particular applications to large-scale databases and hypertext systems. Our prediction algorithms with particular applications to large-scale databases and hypertext systems. Our prediction algorithms for prefetching are novel in that they are based on data compression techniques that are both theoretically optimal and good in practice. Intuitively, in order to compress data effectively, you have to be able to predict future data well, and thus good data compressors should be able to predict well for purposes of prefetching. We show for powerful models such as Markov sources and
m
the order Markov sources that the page fault rate incurred by our prefetching algorithms are optimal in the limit for almost all sequences of page requests.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference37 articles.
1. ABE N. AND WARMUTH M. 1990. On the computational complexity of approximating distribu- ~ tions by probabilistic automata. UCSC UCSC-CRL-90-63. ABE N. AND WARMUTH M. 1990. On the computational complexity of approximating distribu- ~ tions by probabilistic automata. UCSC UCSC-CRL-90-63.
2. BELL T. C. CLEARY J. C. AND WITTEN I.H. 1990. Text Compression. Prentice-Hall Advanced ~ Refer~ence Series. Prentice-Hall Englewood Cliffs N.J. BELL T. C. CLEARY J. C. AND WITTEN I.H. 1990. Text Compression. Prentice-Hall Advanced ~ Refer~ence Series. Prentice-Hall Englewood Cliffs N.J.
3. An analog to the minimax theorem for vector payoffs;BLACKWELL D.;Pac. J. Math.,1956
4. Occam's Razor
5. Learnability and the Vapnik-Chervonenkis dimension
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献