Competitive analysis of randomized paging algorithms

Theoretical Computer Science

Volumn 234, Issue 1-2, 2000, Pages 203-218

  Achlioptas, Dimitris ^a   Chrobak, Marek ^b   Noga, John ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b University of California Riverside   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Analysis of algorithms; Competitive analysis; On line algorithms; Paging; Randomized algorithms

Indexed keywords

EID: 0141948185     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00116-9     Document Type: Article

References (23)

1. A. Borodin, S. Irani, P. Raghavan, B. Schieber, Competitive paging with locality of reference, in: Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 249-259.
2. A. Borodin, S. Irani, P. Raghavan, B. Schieber, Competitive paging with locality of reference, J. Comput. System Sci. 50 (2) (1995) 244-258.
3. M. Chrobak, L.L. Larmore, An optimal online algorithm for k servers on trees, SIAM J. Comput. 20 (1991) 144-148.
4. M. Chrobak, L.L. Larmore, Metrical service systems: randomized strategies, manuscript, 1992a.
5. M. Chrobak, L.L. Larmore, Generosity helps or an 11-competitive algorithm for three servers, J. Algorithms 16 (1994) 234-263; also in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1992b, pp. 196-202.
6. M. Chrobak, L.L. Larmore, Generosity helps or an 11-competitive algorithm for three servers, J. Algorithms 16 (1994) 234-263; also in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1992b, pp. 196-202.
7. M. Chrobak, L.L. Larmore, N. Reingold, J. Westbrook, Page migration algorithms using work functions, Tech. Report YALE/DCS/RR-910, Department of Computer Science, Yale University, 1992, J. Algorithms, to appear.
8. A. Fiat, R. Karp, M. Luby, L.A. McGeoch, D. Sleator, N.E. Young, Competitive paging algorithms, J. Algorithms 12 (1991) 685-699.
9. S. Irani, S. Seiden, Randomized algorithms for metrical task systems, in: Proc. 4th Workshop on Algorithms and Data Structures, 1995, pp. 159-170.
10. S. Irani, A. Karlin, S. Phillips, Strongly competitive algorithms for paging with locality of reference, in: 3rd Annu. ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 228-236.
11. A. Karlin, S. Phillips, P. Raghavan, Markov paging, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 208-217.
12. E. Koutsoupias, C. Papadimitriou, Beyond competitive analysis, in: Proc. 35th Symp. on Foundations of Computer Science, 1994a, pp. 394-400.
13. E. Koutsoupias, C. Papadimitriou, On the k-server conjecture, in: Proc. 26th Symp. on Theory of Computing, 1994, pp. 507-511.
14. E. Koutsoupias, C. Papadimitriou, On the k-server conjecture, J. Assoc. Comput. Mach. 42 (5) (1995) 971-983.
15. H. Kuhn, Extensive games and the problem of information, in: Kuhn, H., Tucker, A. (Eds.), Contributions to the Theory of Games, Princeton University Press, 1953, pp. 193-216.
16. C. Lund, N. Reingold, Linear programs for randomized on-line algorithms, in: Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994a, pp. 382-391.
17. C. Lund, N. Reingold, J. Westbrook, D. Yan, On-line distributed data management, in: Proc. European Symp. on Algorithms, 1994b, pp. 202-214.
18. M. Manasse, L.A. McGeoch, D. Sleator, Competitive algorithms for server problems, J. Algorithms 11 (1990) 208-230.
19. L. McGeoch, D. Sleator, A strongly competitive randomized paging algorithm, J. Algorithms 6 (1991) 816-825.
20. P. Raghavan, M. Snir, Memory versus randomization in online algorithms, in: 16th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 372. Springer, Berlin, 1989, pp. 687-703.
21. D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, 28 (1985) 202-208.
22. N. Young, On-line caching as cache size varies, in: Proc. 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms, 1991, pp. 241-250.
23. N. Young, The k-server dual and loose competitiveness for paging, Algorithmica 11 (6) (1994) 525-541.