Jeffrey Scott Vitter, P. Krishnan  Home/Search
Context Related
| bbcr.uwaterloo.ca/~...optimalFOCS91.ps belllabs.com/user/p...prefetchingj.ps belllabs.com/who/pk...prefetchingj.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: bbcr.uwaterloo.ca/~bre...readings (more) From: belllabs.com/who/pk/publ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 for... (Update)
Cited by: More
Online Performance-Improvement - Prasad Chalasani August (Correct)
C-Miner: Mining Block Correlations in Storage Systems - Li, Chen, Srinivasan, Zhou (2004) (Correct)
Performance Enhancement of Combining QoS Provisioning and.. - Yu, Wong, Leung (2004) (Correct)
Similar documents (at the sentence level):
47.3%: Cs-1995-25 - Jeffrey Scott Vitter (1995) (Correct)
44.0%: Optimal Prefetching via Data Compression - Vitter (1991) (Correct)
42.9%: Online Prediction Algorithms for Databases and Operating Systems - Krishnan (1995) (Correct)
Active bibliography (related documents): More All
1.0: Optimal Prediction for Prefetching in the Worst Case - Krishnan, Vitter (1994) (Correct)
0.5: Optimal Prediction For Prefetching In The Worst Case - Krishnan, Vitter (1998) (Correct)
0.2: Practical Prefetching via Data Compression - Curewitz, Krishnan, Vitter (1993) (Correct)
Similar documents based on text: More All
0.5: Dynamic Generation of Discrete Random Variates - Matias, Vitter, Ni (1997) (Correct)
0.4: Approximation Algorithms for Geometric Median Problems - Lin, Vitter (1992) (Correct)
0.3: e-Approximations with - Minimum Packing Constraint (Correct)
Related documents from co-citation: More All
23: Practical Prefetching via Data Compression - Curewitz, Krishnan et al. - 1993
17: Compression of individual sequences via variable-rate coding - Ziv, Lempel
16: An analytical approach to file prefetching - Lei, Duchamp - 1997
BibTeX entry: (Update)
J. S. Vitter & P. Krishnan, "Optimal Prefetching via Data Compression," Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (October 1991), also appears as Brown Univ. Tech. Rep. No. CS--91--46. http://citeseer.ist.psu.edu/article/vitter95optimal.html More
@article{ vitter96optimal,
author = "Jeffrey Scott Vitter and P. Krishnan",
title = "Optimal prefetching via data compression",
journal = "Journal of the ACM",
volume = "43",
number = "5",
pages = "771--793",
year = "1996",
url = "citeseer.ist.psu.edu/article/vitter95optimal.html" }
Citations (may not include all citations):488 Amortized Efficiency of List Update and Paging Rules (context) - Sleator, Tarjan - 1985
465 Learnability and the Vapnik Chervonenkis Dimension (context) - Blumer, Ehrenfeucht et al. - 1989
372 Information Theory and Reliable Communication (context) - Gallager - 1968
344 Design and Evaluation of a Compiler Algorithm for Prefetchin.. - Mowry, Lam et al. - 1992
344 Arithmetic Coding for Data Compression (context) - Witten, Neal et al. - 1987
293 Compression of Individual Sequences via Variable-Rate Coding - Ziv, Lempel - 1978
148 A First Course in Stochastic Processes (context) - Karlin, Taylor
118 Practical Prefetching via Data Compression - Curewitz, Krishnan et al. - 1993
117 Estimation of Dependencies Based on Empirical Data (context) - Vapnik - 1982
115 Efficient Distribution-Free Learning of Probabilistic Concep.. - Kearns, Schapire - 1990
102 Competitive Paging with Locality of Reference (context) - Borodin, Irani et al. - 1991
96 Occam's Razor (context) - Blumer, Ehrenfeucht et al. - 1987
93 Fido: A Cache that Learns to Fetch (context) - Palmer, Zdonik - 1991
90 Reducing Memory Latency via Non-blocking and Prefetching Cac.. - Chen, Baer - 1992
88 A Strongly Competitive Randomized Paging Algorithm (context) - McGeoch, Sleator - 1989
86 Large Deviations for Performance Analysis (context) - Shwartz, Weiss - 1995
81 Universal Prediction of Individual Sequences (context) - Feder, Merhav et al. - 1992
75 Strongly Competitive Algorithms for Paging with Locality of .. (context) - Irani, Karlin et al. - 1992
56 Approximation to Bayes Risk in Repeated Plays (context) - Hannan - 1957
53 Software Support for Speculative Loads - Rogers, Li - 1992
50 the Computational Complexity of Approximating Distributions .. - Abe, Warmuth - 1990
49 A Status Report on Research in Transparent Informed Prefetch.. - Patterson, Gibson et al. - 1993
49 the Complexity of Finite Sequences (context) - Lempel, Ziv - 1976
49 Markov Paging (context) - Karlin, Phillips et al. - 1992
48 An Introduction to Arithmetic Coding (context) - Langdon - 1984
31 Discrete Sequence Prediction and its Applications (context) - Laird - 1992
27 Analysis of Arithmetic Coding for Data Compression - Howard, Vitter - 1992
27 Optimal Prediction for Prefetching in the Worst Case - Krishnan, Vitter - 1994
21 the Necessity of Occam Algorithms (context) - Board, Pitt - 1990
20 On Competitive Algorithms for Paging Problems (context) - Fiat, Karp et al. - 1991
18 A note on the Ziv-Lempel model for compressing individual se.. (context) - Langdon - 1983
11 An Analysis of Prepaging (context) - Trivedi - 1979
9 Large Deviations for Coding Markov Chains and Gibbs Random F.. (context) - Amit, Miller - 1990
9 Prentice Hall Advanced Reference Series (context) - Bell, Cleary et al. - 1990
8 A theory of productivity in the creative process (context) - Brady - 1986
7 Compound Bayes Predictors with Apparent Markov Structure (context) - Cover, Shenhar - 1977
7 An Analog to the Minimax Theorem for Vector Payoffs (context) - Blackwell - 1956
4 Online Background Predictors and Prefetchers (context) - Vitter, Curewitz et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://bbcr.uwaterloo.ca/~brecht/courses/756/readings.html): More
End-to-End Routing Behavior in the Internet - Paxson (1996) (Correct)
Web Prefetching Between Low-Bandwidth Clients and Proxies.. - Li Fan (1999) (Correct)
On Calibrating Measurements of Packet Transit Times - Paxson (1998) (Correct)
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