The relative worst order ratio applied to paging

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 718-727

  Boyar, Joan ^a   Favrholdt, Lene M ^a   Larsen, Kim S ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY SEQUENCES; ONLINE SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

ON-LINE ALGORITHMS; PAGING; RANDOM ORDER RATIO; WORST ORDER RATIO;

VIRTUAL STORAGE;

EID: 20744439082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234(1-2):203-218, 2000.
2. S. Albers. On the influence of lookahead in competitive paging algorithms. Algorithmica, 18:283-305, 1997.
3. S. Albers, L.M. Favrholdt, and O. Giel. On paging with locality of reference. In 34th Annual ACM Symposium on the Theory of Computing, pages 258-267, 2002.
4. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
5. S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11(1):73-91, 1994.
6. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences, 50(2):244-258, 1995.
7. J. Boyar and L.M. Favrholdt. The relative worst order ratio for on-line algorithms. In 5th Italian Conference on Algorithms and Complexity, volume 2653 of LNCS, pages 58-69, 2003.
8. J. Boyar and K.S. Larsen. The seat reservation problem. Algorithmica, 25:403-417, 1999.
9. J. Boyar, K.S. Larsen, and M.N. Nielsen. The accommodating function - a generalization of the competitive ratio. SIAM Journal of Computation, 31(1):233-258, 2001.
10. J. Boyar and P. Medvedev. The relative worst order ratio applied to seat reservation. In Proceedings of the Ninth Scandinavian Workshop on Algorithm Theory, volume 3111 of LNCS, pages 90-101, 2004.
11. D. Breslauer. On competitive on-line paging with lookahead. Theoretical Computer Science, 209(1-2):365-375, 1998.
12. M. Chrobak and J. Noga. LRU Is Better than FIFO. Algorithmica, 23:180-185, 1999.
13. L. Epstein, L.M. Favrholdt, and J.S. Kohrt. The relative worst order ratio applied to scheduling problems. Manuscript, 2004.
14. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
15. A. Fiat and Z. Rosen. Experimental studies of access graph based heuristics: Beating the LRU standard? In 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 63 - 72, 1997.
16. R.L. Graham. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
17. D.S. Johnson. Fast algorithms for bin packing. Journal of Computer and System Sciences, 8:272-314, 1974.
18. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47:617-643, 2000.
19. A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.
20. A.R. Karlin, S.J. Phillips, and P. Raghavan. Markov paging. SIAM Journal of Computation, 30:906-922, 2000.
21. C. Kenyon. Best-fit bin-packing with random order. In 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 359-364, 1996.
22. E. Koutsoupias and C.H. Papadimitriou. Beyond competitive analysis. In 35th Annual Symposium on Foundations of Computer Science, pages 394-400, 1994.
23. S.O. Krumke, W.E. de Paepe, J. Rambau, and L. Stougie. Online bin coloring. In 9th Annual European Symposium on Algorithms, volume 2161 of LNCS, pages 74-85, 2001.
24. L.A. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816-825, 1991.
25. P. Raghavan. A statistical adversary for on-line algorithms. In D.D. Sleator L.A. McGeoch, editor, On-Line Algorithms, volume 7 of Series in Discrete Mathematics and Theoretical Computer Science, pages 79-83. American Mathematical Society, 1992.
26. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985.
27. E. Torng. A unified analysis of paging and caching. Algorithmica, 20:175-200, 1998.
28. N. Young. Competitive paging and dual-guided algorithms for weighted caching and matching (thesis). Technical Report CS-TR-348-91, Computer Science Department, Princeton University, 1991.
29. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11:525-541, 1994.