Competitive analysis of randomized paging algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 419-430

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

^a UNIVERSITY OF TORONTO   (Canada)

^b University of California ^*  (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPETITIVE ALGORITHMS; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; COMPLEXITY BOUNDS; MARKING ALGORITHM; PAGING ALGORITHMS;

ALGORITHMS;

EID: 84958059317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_72     Document Type: Conference Paper

References (16)

1. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. In Proc. 23rd A CM Symposium on Theory of Computing, pages 249-259, 1991. To appear in Journal of Computer and System Sciences.
2. M. Chrobak and L. L. Larmore. An optimal online algorithm for k servers on trees. SIAM Journal on Computing, 20:144-148, 1991.
3. M. Chrobak and L. L. Larmore. Metrical service systems: Randomized strategies. manuscript, 1992.
4. M. Chrobak and L. L. Larmore. Generosity helps or an ll-competitive algorithm for three servers. Journal of Algorithms, 16:234-263, 1994. Also in Proceedings of ACM/SIAM Symposium on Discrete Algorithms, 1992, 196-202.
5. M. Chrobak, L. L. Larmore, N. Reingold, and J. Westbrook. Page migration algorithms using work functions. Technical Report YALE/DCS/RR-910, Department of Yale University, 1992. Submitted for journal publication.
6. A. Fiat, R. Karp, M. Luby, L. A. McGeoch, D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
7. S. Irani, A. Karlin, and S. Phillips. Strongly competitive algorithms for paging with locality of reference. In 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 228-236, 1992.
8. A. Karlin, S. Phillips, and P. Raghavan. Markov paging. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pages 208-217, 1992.
9. E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proc. 25th Symposium on Foundations of Computer Science, pages 394-400, 1994.
10. E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. In Proc. Z5th Symposium on Theory of Computing, pages 507-511, 1994.
11. H. Kuhn. Extensive games and the problem of information. In H. Kuhn and A. Tucker, editors, Contributions to the Theory of Games, pages 193-216. Princeton University Press, 1953.
12. M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for-server problems. Journal of Algorithms, 11:208-230, 1990. Also in Proc. 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 322-333.
13. L. McGeoch and D. Sleator. A strongly competitive randomized paging algorithm. J. Algorithms, 6:816-825, 1991.
14. P. Raghavan and M. Snir. Memory versus randomization in online algorithms. In 16th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science vol. 372, pages 687-703. Springer-Verlag, 1989.
15. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
16. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 1991. To appear. Rewritten version of "On-line caching as cache size varies", in The 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 241-250, 1991.