Better algorithms for unfair metrical task systems and applications

Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems and apply these techniques to obtain improved randomized online algorithms for metrical task systems on arbitrary metric spaces. 1. Introduction. Metrical task systems (MTSs), introduced by Borodin, Linial, and Saks (11), can be described as follows: A server in some internal state receives tasks that have a service cost associated with each of the internal states. The server may switch states, paying a cost given by a metric space defined on the state space, and then pays the service cost associated with the new state. MTSs have been the subject of a great deal of study. A large part of the research into online algorithms can be viewed as a study of some particular MTS. In modelling some of these problems as MTSs, the set of permissible tasks is constrained to fit the particulars of the problem. In this paper we consider the original definition of MTSs, where the set of tasks can be arbitrary. A deterministic algorithm for any n-state MTS with a competitive ratio of 2n − 1

[1]  Béla Bollobás,et al.  A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[3]  Steven S. Seiden,et al.  Unfair Problems and Randomized Algorithms for Metrical Task Systems , 1999, Inf. Comput..

[4]  Marek Chrobak,et al.  Competive Analysis of Randomized Paging Algorithms , 1996, ESA.

[5]  Andrew Tomkins,et al.  A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.

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

[7]  Yuval Rabani,et al.  A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems , 2000, SIAM J. Comput..

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

[9]  Yuval Rabani,et al.  Lower Bounds for Randomized k-Server and Motion-Planning Algorithms , 1994, SIAM J. Comput..

[10]  Adam Tauman Kalai,et al.  Finely-competitive paging , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[11]  Avrim Blum,et al.  On-line Learning and the Metrical Task System Problem , 1997, COLT '97.

[12]  Neal E. Young,et al.  On-Line File Caching , 2002, SODA '98.

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

[14]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[15]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[16]  Steven S. Seiden,et al.  A General Decomposition Theorem for the k-Server Problem , 2001, Inf. Comput..

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

[18]  Yuval Rabani,et al.  A decomposition theorem and bounds for randomized server problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

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

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

[22]  Marek Chrobak,et al.  The Server Problem and On-Line Games , 1991, On-Line Algorithms.

[23]  Sandy Irani,et al.  Randomized Algorithms for Metrical Task Systems , 1998, Theor. Comput. Sci..

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

[25]  Yuval Rabani,et al.  Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.