Randomized competitive algorithms for the list update problem

We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan. We give a simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani. Our algorithm uses randomness only during an initialization phase, and from then on runs completely deterministically. It is the first randomized competitive algorithm with this property to beat the deterministic lower bound. We generalize our approach to a model in which access costs are fixed but update costs are scaled by an arbitrary constantd. We prove lower bounds for deterministic list update algorithms and for randomized algorithms against oblivious and adaptive on-line adversaries. In particular, we show that for this problem adaptive on-line and adaptive off-line adversaries are equally powerful.

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

[2]  Robert E. Tarjan,et al.  A Locally Adaptive Data , 1986 .

[3]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

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

[5]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[6]  Sandy Irani,et al.  Two Results on the List Update Problem , 1991, Inf. Process. Lett..

[7]  Kenneth L. Clarkson,et al.  Fast linear expected-time algorithms for computing maxima and convex hulls , 1993, SODA '90.

[8]  R. Lathe.  Phd by thesis , 1988, Nature.

[9]  M. Luby,et al.  On ~ competitive algorithms for paging problems , 1991 .

[10]  John McCabe,et al.  On Serial Files with Relocatable Records , 1965 .

[11]  David L. Black,et al.  Competitive algorithms for replication and migration problems , 1989 .

[12]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[13]  Jon Louis Bentley,et al.  Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.

[14]  Marek Chrobak,et al.  On Fast Algorithms for Two Servers , 1991, J. Algorithms.

[15]  Allan Borodin,et al.  An optimal online algorithm for metrical task systems , 1987, STOC.

[16]  Jeffery R. Westbrook.  Randomized Algorithms for Multiprocessor Page Migration , 1994, SIAM J. Comput..

[17]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[18]  Samuel D. Conte,et al.  Elementary Numerical Analysis: An Algorithmic Approach , 1975 .

[19]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[20]  P. J. Burville,et al.  On a model for storage and search , 1973, Journal of Applied Probability.

[21]  W. J. Hendricks.  An Account of Self-Organizing Systems , 1976, SIAM J. Comput..

[22]  Allan Borodin,et al.  On the power of randomization in online algorithms , 1990, STOC '90.

[23]  Prabhakar Raghavan,et al.  Random walks on weighted graphs, and applications to on-line algorithms , 1990, STOC '90.