Online Algorithms for Weighted Paging with Predictions

A Simple Analysis for Randomized Online Weighted Paging

We describe a new potential function based proof for anO(log k)-competitive algorithm for weighted paging, and more generally anO(log k/(k−h+1))-competitive algorithm for the weighted (h, k)-paging problem. In contrast to previous results that are based on the online primal-dual framework, our analysis is extremely simple, and we believe that the technique might be useful in the analysis of oth...

Limited bookmark randomized online algorithms for the paging problem

An efficient randomized online algorithm for the paging problem for cache size 2 is given, which is 2 -competitive against an oblivious adversary. The algorithm keeps track of at most one page in slow memory at any time. A lower bound of 37 24 ≈ 1.5416 is given for the competitiveness of any trackless online algorithm for the same problem, i.e., an algorithm that keeps track of no page outside ...

Truly Online Paging with Locality of Reference

The competitive analysis fails to model locality of reference in the online paging problem. To deal with it, Borodin et al. introduced the access graph model, which attempts to capture the locality of reference. However, the access graph model has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access gr...

Online Paging and Caching

Competitive Paging Algorithms

*Department of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978; ‘Department of Electrical Engineetig and Computer Science, Computer Science Division, University of California, Berkeley, CA 94720; ‘Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M6C 3B7; ‘Department of Mathematics and Computer Science, Amherst College, Amherst, Massachusetts 01002; “...