The relative worst-order ratio applied to paging

Journal of Computer and System Sciences

Volumn 73, Issue 5, 2007, Pages 818-843

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

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Look ahead; LRU; On line algorithms; Paging; Relative worst order ratio; RLRU

Indexed keywords

COMPUTER SCIENCE; ONLINE SYSTEMS; RANDOM PROCESSES; SYSTEMS SCIENCE; VIRTUAL STORAGE;

LOOK AHEAD; ON LINE ALGORITHMS; PAGING ALGORITHMS; RELATIVE WORST ORDER RATIO;

ALGORITHMS;

EID: 34247275168     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.03.001     Document Type: Article

References (38)

1. Achlioptas D., Chrobak M., and Noga J. Competitive analysis of randomized paging algorithms. Theoret. Comput. Sci. 234 1-2 (2000) 203-218
2. Albers S. On the influence of lookahead in competitive paging algorithms. Algorithmica 18 (1997) 283-305
3. Albers S., Favrholdt L.M., and Giel O. On paging with locality of reference. J. Comput. System Sci. 70 (2005) 145-175
4. Becchetti L. Modeling locality: A probabilistic analysis of LRU and FWF. Twelfth European Symposium on Algorithms. Lecture Notes in Comput. Sci. vol. 3221 (2004), Springer-Verlag 98-109
5. Belady L.A. A study of replacement algorithms for virtual storage computers. IBM Systems J. 5 (1966) 78-101
6. Ben-David S., and Borodin A. A new measure for the study of on-line algorithms. Algorithmica 11 1 (1994) 73-91
7. A. Borodin, R. El-Yaniv, On randomization in online computation, in: IEEE Conference on Computational Complexity, 1997, pp. 226-238
8. Borodin A., Irani S., Raghavan P., and Schieber B. Competitive paging with locality of reference. J. Comput. System Sci. 50 2 (1995) 244-258
9. Boyar J., and Favrholdt L.M. The relative worst-order ratio for on-line algorithms. Fifth Italian Conference on Algorithms and Complexity. Lecture Notes in Comput. Sci. vol. 2653 (2003) 58-69 ACM Trans. Algorithms, in press
10. Boyar J., and Larsen K.S. The seat reservation problem. Algorithmica 25 (1999) 403-417
11. Boyar J., Larsen K.S., and Nielsen M.N. The accommodating function-A generalization of the competitive ratio. SIAM J. Comput. 31 1 (2001) 233-258
12. Boyar J., and Medvedev P. The relative worst-order ratio applied to seat reservation. Ninth Scandinavian Workshop on Algorithm Theory. Lecture Notes in Comput. Sci. vol. 3111 (2004), Springer-Verlag 90-101
13. Breslauer D. On competitive on-line paging with lookahead. Theoret. Comput. Sci. 209 1-2 (1998) 365-375
14. Chrobak M., Karloff H., Payne T., and Vishwanathan S. New results on server problems. SIAM J. Discrete Math. 4 2 (1991) 172-181
15. Chrobak M., and Noga J. LRU is better than FIFO. Algorithmica 23 (1999) 180-185
16. Epstein L., Favrholdt L.M., and Kohrt J.S. Separating online scheduling algorithms with the relative worst order ratio. J. Combin. Optim. 12 4 (2006) 362-385
17. Fiat A., Karp R.M., Luby M., McGeoch L.A., Sleator D.D., and Young N.E. Competitive paging algorithms. J. Algorithms 12 (1991) 685-699
18. A. Fiat, Z. Rosen, Experimental studies of access graph based heuristics: Beating the LRU standard?, in: Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 63-72
19. Graham R.L. Bounds for certain multiprocessing anomalies. Bell Systems Technical J. 45 (1966) 1563-1581
20. Johnson D.S. Fast algorithms for bin packing. J. Comput. System Sci. 8 (1974) 272-314
21. Kalyanasundaram B., and Pruhs K. Speed is as powerful as clairvoyance. J. ACM 47 (2000) 617-643
22. Karlin A.R., Manasse M.S., Rudolph L., and Sleator D.D. Competitive snoopy caching. Algorithmica 3 1 (1988) 79-119
23. Karlin A.R., Phillips S.J., and Raghavan P. Markov paging. SIAM J. Comput. 30 (2000) 906-922
24. C. Kenyon, Best-fit bin-packing with random order, in: Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 359-364
25. J.S. Kohrt, Online algorithms under new assumptions, PhD thesis, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark, 2004
26. Kohrt J.S., and Larsen K.S. On-line seat reservations via off-line seating arrangements. Internat. J. Found. Comput. Sci. 16 2 (2005) 381-397
27. E. Koutsoupias, C.H. Papadimitriou, Beyond competitive analysis, in: Thirty-Fifth Annual Symposium on Foundations of Computer Science, 1994, pp. 394-400
28. Krumke S.O., de Paepe W.E., Rambau J., and Stougie L. Online bin coloring. Ninth Annual European Symposium on Algorithms. Lecture Notes in Comput. Sci. vol. 2161 (2001) 74-85
29. Larsen K.S. Testing bin packing algorithms on uniformly distributed data. http://www.imada.sdu.dk/~kslarsen/Archive/
30. M.S. Manasse, L.A. McGeoch, D.D. Sleator, Competitive algorithms for on-line problems, in: Twentieth Annual ACM Symposium on the Theory of Computing, 1988, pp. 322-333
31. McGeoch L.A., and Sleator D.D. A strongly competitive randomized paging algorithm. Algorithmica 6 (1991) 816-825
32. Raghavan P. A statistical adversary for on-line algorithms. In: Sleator D.D., and McGeoch L.A. (Eds). On-Line Algorithms. Discrete Math. Theor. Comput. Sci. vol. 7 (1992), American Mathematical Society 79-83
33. Sleator D.D., and Tarjan R.E. Amortized efficiency of list update and paging rules. Commun. ACM 28 2 (1985) 202-208
34. Torng E. A unified analysis of paging and caching. Algorithmica 20 (1998) 175-200
35. van Kreveld M.J., and Overmars M.H. Union-copy structures and dynamic segment trees. J. ACM 40 3 (1993) 635-652
36. N. Young, Competitive paging and dual-guided algorithms for weighted caching and matching, PhD thesis, Technical Report CS-TR-348-91, Computer Science Department, Princeton University, 1991
37. Young N. The k-server dual and loose competitiveness for paging. Algorithmica 11 (1994) 525-541
38. Young N. On-line file caching. Algorithmica 33 3 (2002) 371-383