论文信息 - A Simple Analysis for Randomized Online Weighted Paging

A Simple Analysis for Randomized Online Weighted Paging

We describe a new potential function based proof for an O(log k)-competitive algorithm for weighted paging, and more generally an O(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 other related problems.

[1] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.

[2] Neal Young,et al. The K-Server Dual and Loose Competitiveness for Paging , 1991, On-Line Algorithms.

[3] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.

[4] Sandy Irani,et al. Randomized Weighted Caching with Two Page Weights , 2002, Algorithmica.

[5] Joseph Naor,et al. A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[6] Marek Chrobak,et al. Competitive analysis of randomized paging algorithms , 2000, Theor. Comput. Sci..

[7] Neal E. Young,et al. On-line caching as cache size varies , 1991, SODA '91.

[8] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.

[9] Allan Borodin,et al. Online computation and competitive analysis , 1998 .

[10] Joseph Naor,et al. Towards the randomized k-server conjecture: a primal-dual approach , 2010, SODA '10.

[11] Amos Fiat,et al. Better algorithms for unfair metrical task systems and applications , 2000, STOC '00.

[12] Lyle A. McGeoch,et al. A strongly competitive randomized paging algorithm , 1991, Algorithmica.

[13] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.