The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms

Journal of Algorithms

Volumn 23, Issue 2, 1997, Pages 241-264

  Bartal, Yair ^a   Rosén, Adi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013405835     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0826     Document Type: Article

References (32)

1. B. Awerbuch, Y. Bartal, and A. Fiat, Competitive distributed file allocation, in "Proc. of the 25th Ann. ACM Symp. on the Theory of Computing, May 1993," pp. 164-173.
2. B. Awerbuch, Y. Bartal, and A. Fiat, Heat & Dump: Competitive distributed paging, in "Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, Oct. 1993," pp. 22-31.
3. B. Awerbuch, Y. Bartal, and A. Fiat, Distributed paging for general networks, in "Proc. of the 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, Jan. 1996," pp. 574-583.
4. B. Awerbuch, S. Kutten, and D. Peleg, Competitive distributed job scheduling, in "Proc. of the 24th Ann. ACM Symp. on the Theory of Computing, May 1992," pp. 571-580. Also Theoret. Comput. Sci. 130 (1994).
5. B. Awerbuch, S. Kutten, and D. Peleg, Competitive distributed job scheduling, in "Proc. of the 24th Ann. ACM Symp. on the Theory of Computing, May 1992," pp. 571-580. Also Theoret. Comput. Sci. 130 (1994).
6. N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer, Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling, in "Proc. of the 33rd Ann. IEEE Symp. on Foundations of Computer Science, Oct. 1992," pp. 334-343.
7. B. Awerbuch and D. Peleg, Concurrent online tracking of mobile users, in "Proc. SIGCOMM, Zurich, Sept. 1991."
8. S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson, On the power of randomization in online algorithms, in "Proc. of the 22nd Ann. ACM Symp. on the Theory of Computing, May 1990," pp. 379-386. Also Algorithmica 11 (1994), 2-14.
9. S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson, On the power of randomization in online algorithms, in "Proc. of the 22nd Ann. ACM Symp. on the Theory of Computing, May 1990," pp. 379-386. Also Algorithmica 11 (1994), 2-14.
10. R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins, "Searching with Uncertainty," Technical report, University of Waterloo, Oct. 1987.
11. Y. Bartal, A. Fiat, and Y. Rabani, Competitive algorithms for distributed data management, in "Proc. of the 24th Ann. ACM Symp. on the Theory of Computing, May 1992," pp. 39-48.
12. Y. Bartal and E. Grove, The harmonic k-server algorithm is competitive, J. Assoc. Comput. Mach., 39, 1992, 745-763.
13. P. Berman, H. Karloff, and G. Tardos, A competitive 3-server algorithm, in "Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, Jan. 1990," pp. 280-290.
14. A. Borodin, N. Linial, and M. Saks, An optimal on-line algorithm for metrical task systems, in "Proc. of the 19th Ann. ACM Symp. on the Theory of Computing, May 1987," pp. 373-382.
15. M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New results on server problems, in "Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, Jan. 1990," pp. 291-300. Also SIAM J. Discrete Math. 4(2) (1991), 172-184.
16. M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New results on server problems, in "Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, Jan. 1990," pp. 291-300. Also SIAM J. Discrete Math. 4(2) (1991), 172-184.
17. M. Chrobak and L. Larmore, An optimal on-line k-server algorithm for trees, SIAM J. Comput. 20 (1991), 144-148.
18. M. Chrobak and L. Larmore, On fast algorithms for two servers, in "Proc. Mathematical Foundations of Computer Science," Banská Bystrica, 1990;
19. also J. Algorithms 12 (1991), 607-614.
20. W. Dijkstra and C. S. Scholten, Termination detection for diffusing computations, Inform. Process. Lett. 11(1) (1980), 1-4.
21. A. Fiat, Y. Rabani, and Y. Ravid, Competitive k-server algorithms, in "Proc. of the 31st Ann. IEEE Symp. on Foundations of Computer Science, Oct. 1990," pp. 454-463.
22. Also J. Comput. System Sci. 48 (1994), 410-428.
23. 3)-competitive k-server algorithm for the circle, Algorithmica, 11, 572-578, 1994.
24. E. Grove, The harmonic k-server algorithm is competitive, in "Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, May 1991," pp. 260-266.
25. S. Irani and R. Rubinfeld, A competitive 2-server algorithm, Inform. Process. Lett., 39 (1991), 85-91.
26. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator, Competitive snoopy caching, Algorithmica 3(1) (1988), 79-119.
27. E. Koutsoupias and C. Papadimitriou, On the k-server conjecture, in "Proc. 26th Annual ACM Symp. on Theory of Computing, 1994," pp. 507-511.
28. M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive algorithms for on-line problems, in "Proc. of the 20th Ann. ACM Symp. on the Theory of Computing, May 1988," pp. 322-333. Also J. Algorithms 11 (1990), 208-230.
29. M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive algorithms for on-line problems, in "Proc. of the 20th Ann. ACM Symp. on the Theory of Computing, May 1988," pp. 322-333. Also J. Algorithms 11 (1990), 208-230.
30. P. Raghavan and M. Snir, Memory versus randomization in on-line algorithms, in "Proc. 16th ICALP, July 1989."
31. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. Assoc. Comput. Mach., 28(2) (1985), 202-208.
32. G. Turpin, "Recent Work on the Server Problem," Master's thesis, University of Toronto, 1989.