Competitive caching of query results in search engines
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A page fault equation for modeling the effect of memory size
Performance Evaluation
Entropy-based bounds for online algorithms
ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Workstation capacity tuning using reinforcement learning
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the relative dominance of paging algorithms
Theoretical Computer Science
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Data structures on event graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Paging and list update under bijective analysis
Journal of the ACM (JACM)
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
| Hi-index | 0.00 |
This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the fault-rate of paging algorithms. We first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain. Next, we address the problem of devising a paging strategy with low fault-rate for a given Markov chain. We show that a number of intuitive approaches fail. Our main result is a polynomial-time procedure that, on any Markov chain, will give a paging algorithm with fault-rate at most a constant times optimal. Our techniques show also that some algorithms that do poorly in practice fail in the Markov setting, despite known (good) performance guarantees when the requests are generated independently from a probability distribution.