On the Influence of Lookahead in Competitive Paging Algorithms

Algorithmica (New York)

Volumn 18, Issue 3, 1997, Pages 283-305

  Albers, S ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Competitive analysis; Lookahead; On line algorithms; Paging

Indexed keywords

EID: 0001342825     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009158     Document Type: Article

References (17)

1. A. Agarwal, R.L. Sites, and M. Horowitz. ATUM: A new technique for capturing address traces using microcode. In Proc. 13th Annual Symposium on Computer Architecture, pages 119-127, 1986.
2. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
3. S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11(1):73-91, 1994.
4. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1):2-14, 1994.
5. F.K. Chung, R. Graham, and M.E. Saks. A dynamic location problem for graphs. Combinatorica, 9(2):111-131, 1989.
6. 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.
7. M.M. Halldórsson and M. Szegedy. Lower bounds for on-line graph coloring. In Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 211-216, 1992.
8. S. Irani. Coloring inductive graphs on-line. Algorithmica, 11(1):53-62, 1994.
9. M.-Y. Kao and S.R. Tate. Online matching with blocked input. Information Processing Letters, 38:113-116, 1991.
10. A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.
11. L.A. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816-825, 1991.
12. P. Raghavan. Lecture notes on randomized algorithms. IBM Research Report No. RC 15340 (#68237), Yorktown Heights, 1989.
13. P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. In Proc. 16th International Colloquium on Automata, Languages and Programming, pages 687-703, 1989. Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin.
14. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202-208, 1985.
15. J.R. Spirn. Program Behavior: Models and Measurements. Elsevier, New York, 1977.
16. A.C.-C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 17th Annual IEEE Symposium of Foundations of Computer Science, pages 222-227, 1977.
17. N. Young. Competitive Paging and Dual-Guided On-Line Weighted Caching and Matching Algorithms. Ph.D. thesis, Princeton University, 1991. Available as Computer Science Department Technical Report CS-Tr-348-91.