SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Paging on a RAM with Limited Resources
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Experimental Results on Statistical Approaches to Page Replacement Policies
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Evaluating Server-Assisted Cache Replacement in the Web
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
| 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. The authors use this model to study the fault-rate of paging algorithms, a quantity of interest to practitioners. They first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain. They address the problem of efficiently devising a paging strategy with low fault-rate for a given Markov chain. They show that a number of intuitively good approaches fail. Their main result is an efficient procedure that, on any Markov chain, will give a paging algorithm with fault-rate at most a constant times optimal. Their techniques also show 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.