Engineering Efficient Paging Algorithms
In the field of online algorithms paging is a well studied problem. LRU is a simple paging algorithm which incurs few cache misses and supports efficient implementations. Algorithms outperforming LRU in terms of cache misses exist, but are in general more complex and thus not automatically better, since their increased runtime might annihilate the gains in cache misses. In this paper we focus on efficient implementations for the OnOPT class described in , particularly on an algorithm in this class, denoted RDM, that was shown to typically incur fewer misses than LRU. We provide experimental evidence on a wide range of cache traces showing that our implementation of RDM is competitive to LRU with respect to runtime. In a scenario incurring realistic time penalties for cache misses, we show that our implementation consistently outperforms LRU, even if the runtime of LRU is set to zero.
KeywordsCompetitive Ratio Online Algorithm Cache Size Competitive Analysis Time Penalty
Unable to display preview. Download preview PDF.
- 6.Brodal, G.S., Moruz, G., Negoescu, A.: OnlineMIN: A fast strongly competitive randomized paging algorithm. In: Proc. 9th Workshop on Approximation and Online Algorithms, pp. 164–175 (2011)Google Scholar
- 8.Fiat, A., Rosen, Z.: Experimental studies of access graph based heuristics: Beating the LRU standard? In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 63–72 (1997)Google Scholar
- 13.Moruz, G., Negoescu, A.: Outperforming LRU via competitive analysis on paramtrized inputs for paging. In: Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1669–1680 (2012)Google Scholar
- 15.Tanenbaum, A.S.: Modern operating systems, 3rd edn. Pearson Education (2008)Google Scholar