P. Krishnan, Jeffrey Scott Vitter  Home/Search
Context Related
| duke.edu/~jsv/Pape...prefetching.ps.gz 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: duke.edu/~jsv/Papers/cat...node83 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache-replacement methods are attracting renewed attention because of their success in avoiding costly I/Os. Prefetching can be looked upon as a type of online sequential prediction, where the predictions must be accurate as well as made in a computationally efficient way. Unlike other online problems, prefetching cannot admit a competitive analysis, since the optimal offline... (Update)
Cited by: More
A Suffix Tree Based Prediction Scheme for Pervasive.. - Katsaros, Manolopoulos (2005) (Correct)
A Note On Sequence Prediction - Travis Gagie Department (Correct)
Evaluating Location Predictors with Extensive Wi-Fi Mobility.. - Song, Kotz, Jain, He (2004) (Correct)
Similar documents (at the sentence level):
44.1%: Optimal Prediction For Prefetching In The Worst Case - Krishnan, Vitter (1998) (Correct)
37.4%: Optimal Prediction for Prefetching in the Worst Case - Krishnan, Vitter (1993) (Correct)
24.0%: Online Prediction Algorithms for Databases and Operating Systems - Krishnan (1995) (Correct)
Active bibliography (related documents): More All
1.0: Optimal Prefetching via Data Compression - Vitter, Krishnan (1995) (Correct)
0.2: Practical Prefetching via Data Compression - Curewitz, Krishnan, Vitter (1993) (Correct)
0.2: Membership in Constant Time and Minimum Space - Brodnik, Munro (1994) (Correct)
Similar documents based on text: More All
0.5: Can Entropy Characterize Performance of Online Algorithms? - Pandurangan, Upfal (2001) (Correct)
Related documents from co-citation: More All
13: Practical Prefetching via Data Compression - Curewitz, Krishnan et al. - 1993
11: Compression of individual sequences via variable-rate coding - Ziv, Lempel
10: Dynamic Generation of Discrete Random Variates - Matias, Vitter et al. - 1993
BibTeX entry: (Update)
P. Krishnan and J. S. Vitter, "Optimal Prediction for Prefetching in the Worst Case," SIAM Journal on Computing , to appear pending minor revisions. A shortened version appeared in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994, 392--401. 20 7. CONCLUSIONS http://citeseer.ist.psu.edu/article/krishnan94optimal.html More
@inproceedings{ krishnan94optimal,
author = "Krishnan and Vitter",
title = "Optimal Prediction for Prefetching in the Worst Case",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1994",
url = "citeseer.ist.psu.edu/article/krishnan94optimal.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991
488 Amortized Efficiency of List Update and Paging Rules (context) - Sleator, Tarjan - 1985
442 Concrete Mathematics (context) - Graham, Knuth 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
293 Compression of Individual Sequences via Variable-Rate Coding - Ziv, Lempel - 1978
232 A Study of Replacement Algorithms for Virtual Storage Comput.. (context) - Belady - 1966
216 Volume 2: Seminumerical Algorithms (context) - Knuth, of et al. - 1981
118 Practical Prefetching via Data Compression - Curewitz, Krishnan et al.
102 Competitive Paging with Locality of Reference (context) - Borodin, Irani et al. - 1991
93 Fido: A Cache that Learns to Fetch (context) - Palmer, Zdonik
90 Reducing Memory Latency via Non-blocking and Prefetching Cac.. - Chen, Baer - 1992
88 A Strongly Competitive Randomized Paging Algorithm (context) - McGeoch, Sleator - 1989
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
63 Prefetching in File Systems for MIMD Multiprocessors (context) - Kotz, Ellis - 1990
56 Approximation to Bayes Risk in Repeated Plays (context) - Hannan - 1957
54 Optimal Prefetching via Data Compression - Vitter, Krishnan
53 Software Support for Speculative Loads - Rogers, Li - 1992
49 Markov Paging (context) - Karlin, Phillips et al. - 1992
46 Working Sets Past and Present (context) - Denning - 1980
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
23 A Markovian Extension of Valiant's Learning Model (context) - Aldous, Vazirani - 1990
20 On Competitive Algorithms for Paging Problems (context) - Fiat, Karp et al. - 1991
19 Locality in Page Reference Strings (context) - Shedler, Tung - 1972
19 Dynamic Generation of Discrete Random Variates - Matias, Vitter et al. - 1993
18 A Note on the Ziv-Lempel Model for Compressing Individual Se.. (context) - Langdon - 1983
12 Universal Sequential Learning and Decision from Individual D.. (context) - Merhav, Feder - 1992
11 Adaptive Prefetching for Disk Buffers (context) - Salem - 1991
9 Large Deviations for Coding Markov Chains and Gibbs Random F.. (context) - Amit, Miller - 1990
7 An Analog to the Minimax Theorem for Vector Payoffs (context) - Blackwell - 1956
7 Compound Bayes Predictors with Apparent Markov Structure (context) - Cover, Shenhar - 1977
5 Optimal Algorithms for Generating Discrete Random Variables .. (context) - Hagerup, Mehlhorn et al. - 1992
5 Behavior of Predictors of Binary Sequences (context) - Cover - 1967
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.
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