A decomposition theorem for task systems and bounds for randomized server problems

SIAM Journal on Computing

Volumn 30, Issue 5, 2000, Pages 1624-1661

  Blum, Avrim ^a   Karloff, Howard ^b   Rabani, Yuval ^c   Saks, Michael ^d,e  

^a Carnegie Mellon University   (United States)

^b Georgia Institute of Technology   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d RUTGERS UNIVERSITY   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Competitive analysis; k server; Lower bounds; On line algorithms; Randomized algorithms; Task systems

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; GAME THEORY; MARKOV PROCESSES; MATRIX ALGEBRA; MOTION PLANNING; ONLINE SYSTEMS; RANDOM PROCESSES; THEOREM PROVING;

DECOMPOSITION THEOREM; LOWER BOUNDS; ONLINE ALGORITHMS; RANDOMIZED ALGORITHMS; RANDOMIZED SERVER PROBLEM; TASK SYSTEMS;

BOUNDARY CONDITIONS;

EID: 0035178705     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799351882     Document Type: Article

References (19)

1. S. BEN-DAVID, A. BORODIN, R.M. KARP, G. TARDOS, AND A. WIGDERSON, On the power of randomization in online algorithms, Algorithmica, 11 (1994), pp. 2-14.
2. Y. BARTAL, A. BLUM, C. BURCH, AND A. TOMKINS, A polylog(n)-competitive algorithm for metrical task systems, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, 1997, pp. 711-719.
3. A. BORODIN, N. LINIAL, AND M. SAKS, An optimal on-line algorithm for metrical task systems, J. ACM, 39 (1992), pp. 745-763.
4. A. BORODIN AND R. EL YANIV, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK, 1998.
5. D. COPPERSMITH, P. DOYLE, P. RAGHAVAN, AND M. SNIR, Random walks on weighted graphs and applications to on-line algorithms, J. ACM, 40 (1993), pp. 421-453.
6. A. FIAT, R.M. KARP, M. LUBY, L.A. MCGEOCH, D.D. SLEATOR, AND N.E. YOUNG, Competitive paging algorithms, J. Algorithms, 12 (1991), pp. 685-699.
7. A. FIAT, Y. RABANI, AND Y. RAVID, Competitive k-server algorithms, J. Comput. System Sci., 48 (1994), pp. 410-428.
8. E. GROVE, The harmonic k-server algorithm is competitive, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 260-266.
9. A.R. KARLIN, M.S. MANASSE, L. RUDOLPH, AND D.D. SLEATOR, Competitive snoopy caching, Algorithmica, 3 (1988), pp. 79-119.
10. H.J. KARLOFF, Y. RABANI, AND Y. RAVID, Lower bounds for randomized k-server and motion-planning algorithms, SIAM J. Comput., 23 (1994), pp. 293-312.
11. J.L. KELLEY, General Topology, American Book Company, New York, 1955.
12. E. KOUTSOUPIAS AND C. PAPADIMITHIOU, On the k-server conjecture, J. ACM, 42 (1995), pp. 971-983.
13. C. LUND AND N. REINGOLD, Linear programs for randomized on-line algorithms, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, ACM, New York, SIAM, Philadelphia, 1994, pp. 382-391.
14. M.S. MANASSE, L.A. MCGEOCH, AND D.D. SLEATOR, Competitive algorithms for on-line problems, J. Algorithms, 11 (1990), pp. 208-230.
15. J. MATOUŠEK, Ramsey-like properties for bi-Lipschitz mappings of finite metric spaces, Comment. Math. Univ. Carolin., 33 (1992), pp. 451-463.
16. L.A. MCGEOCH AND D.D. SLEATOR, A strongly competitive randomized paging algorithm, Algorithmica, 6 (1991), pp. 816-825.
17. P. RAGHAVAN AND M. SNIR, Memory versus randomization in on-line algorithms, in Automata, Languages, and Programming (Stresa, 1989), Lecture Notes in Comput. Sci. 372, Springer-Verlag, Berlin, 1989, pp. 687-703.
18. D.D. SLEATOR AND R.E. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
19. J. VON NEUMANN AND O. MORGENSTERN, Theory of Games and Economic Behavior, 2nd ed., Princeton University Press, Princeton, NJ, 1947.