Abstract
In this paper we use competitive analysis to study the performance of randomized on-line paging algorithms. We present two results: we first show that the competitive ratio of the marking algorithm is exactly 2Hk -1. Previously, it was known to be between Hk and 2Hk. Then we provide a new, Ha-competitive algorithm for paging. Our algorithm, as well as its analysis, is simpler than the known algorithm by McGeoch and Steator. Another advantage of our algorithm is that it can be implemented with complexity bounds independent of the number of past requests: O(k2 log k) memory and O(k2) time per request.
Cite
CITATION STYLE
Achlioptas, D., Chrobak, M., & Noga, J. (1996). Competitive analysis of randomized paging algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 419–430). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_72
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
