Optimal Prefetching via Data Compression (1995)

by Jeffrey Scott Vitter , P. Krishnan
Citations:226 - 11 self

Active Bibliography

16 Online Prediction Algorithms for Databases and Operating Systems – P. Krishnan - 1995
Optimal Prediction for Prefetching in the Worst Case – Krishnan Bell Laboratories, P. Krishnan, Jeffrey Scott Vitter - 1994
26 Optimal Prediction for Prefetching in the Worst Case – P. Krishnan, Jeffrey Scott Vitter - 1998
Practical Prefetching via Data Compression – Extended Kenneth, Kenneth M. Curewitz, P. Krishnan, Jeffrey Scott Vitter - 1993
Non-Omniscient Scheduling – Eric Torng, Rajeev Motwani, Vijay Saraswat - 1994
Online paging and caching (1985-2002, multiple authors) – Neal E. Young, et al.
29 Experimental Studies of Access Graph Based Heuristics: Beating the LRU standard? – Amos Fiat, Ziv Rosen - 1997
5 On-line algorithms and the k-server conjecture – Elias Koutsoupias - 1994
19 A Unified Analysis of Paging and Caching – Eric Torng - 1998
3 Competitive Analysis of Paging: A Survey – Sandy Irani - 1996
23 On Online Computation – Sandy Irani, Anna R. Karlin - 1997
114 BEYOND COMPETITIVE ANALYSIS – Elias Koutsoupias, Christos H. Papadimitriou - 2000
59 Competitive Analysis of Randomized Paging Algorithms – Dimitris Achlioptas, Marek Chrobak, John Noga - 2000
24 Page Replacement for General Caching Problems – Susanne Albers, Sanjeev Arora, Sanjeev Khanna - 1999
Competitive Cache Replacement Strategies for a Shared Cache – Anil Kumar Katti - 2011
20 A Multi-Threaded Architecture for Prefetching in Object Bases – Carsten A. Gerlhof, Alfons Kemper - 1994
6 Can Entropy Characterize Performance of Online Algorithms? – Gopal Pandurangan, Eli Upfal - 2001
99 Universal Prediction – Neri Merhav, Meir Feder - 1998
1 Entropy-Based Bounds for Online Algorithms – Gopal Pandurangan, Eli Upfal