P. Krishnan and J. S. Vitter. Optimal prefetching in the worst case. In ACM-SIAM Symposium on Discrete Algorithms, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Practical Prefetching via Data Compression - Curewitz, Krishnan, Vitter (1993) (107 citations) Self-citation (Krishnan Vitter) (Correct)
....in which we predict the user s next page requests and get those pages into cache in the background. Current databases perform limited prefetching using techniques derived from older virtual memory systems. A novel idea of using data compression techniques for prefetching was recently advocated in [KrV, ViK], in which prefetchers based on the Lempel Ziv data compressor (the UNIX compress command) were shown theoretically to be optimal in the limit. In this paper we analyze the practical aspects of using data compression techniques for prefetching. We adapt three well known data compressors to get ....
.... is actually needed [ChB] and a combined hardware and software approach which uses an optimizing compiler and speculative loads to issue read requests in anticipation of a demand request [RoL] The idea of using data compression techniques for prefetching was first advocated by Vitter and Krishnan [KrV, ViK]. The intuition is that data compressors typically operate by postulating (either implicitly or explicitly) a dynamic probability distribution on the data to be compressed. Data expected with high probability are encoded with few bits, and unexpected data with many bits. Thus, if a data compressor ....
[Article contains additional citation context not shown here]
P. Krishnan & J. S. Vitter, "Optimal Prefetching in the Worst Case," manuscript (November 1992).
On the Optimality of Parsing in Dynamic Dictionary Based.. - Matias, Sahinalp (Correct)
No context found.
P. Krishnan and J. S. Vitter. Optimal prefetching in the worst case. In ACM-SIAM Symposium on Discrete Algorithms, 1994.
On the Optimality of Parsing in Dynamic Dictionary Based.. - Matias, Sahinalp (1998) (Correct)
No context found.
P. Krishnan and J. S. Vitter. Optimal prefetching in the worst case. In ACM-SIAM Symposium on Discrete Algorithms, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC