On space bounded server algorithms

This paper is motivated by the need for fast algorithms for online problems, many of which require algorithms to provide solutions in real time. We study a class of arguably fast algorithms (called space bounded algorithms) for the k-server problem on finite metric spaces. Specifically, we provide a necessary and sufficient condition for such algorithms to be competitive on finite metric spaces. Moreover, this characterization provides a strategy for designing competitive algorithms for finite metric spaces.<<ETX>>

[1]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[2]  Yuval Rabani,et al.  Competitive k-server algorithms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[3]  Madhu Sudan,et al.  Online algorithms for locating checkpoints , 1990, STOC '90.

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

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

[6]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.

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

[8]  Marek Chrobak,et al.  A New Approach to the Server Problem , 1991, SIAM J. Discret. Math..

[9]  Sandy Irani,et al.  Strongly competitive algorithms for paging with locality of reference , 1992, SODA '92.

[10]  Marek Chrobak,et al.  An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..

[11]  R. Tarjan.  Amortized Computational Complexity , 1985 .

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

[13]  Prabhakar Raghavan,et al.  Random walks on weighted graphs and applications to on-line algorithms , 1993, JACM.

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

[15]  Edward F. Grove.  The harmonic online K-server algorithm is competitive , 1991, STOC '91.

[16]  Marek Chrobak,et al.  Generosity helps, or an 11–competitive algorithm for three servers , 1992, SODA '92.

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