Skip to main content
SpringerLink
Log in

The influence of lookahead in competitive paging algorithms

Extended abstract

  • Conference paper
  • First Online:
Algorithms—ESA '93 (ESA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 726))

Included in the following conference series:

Abstract

We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging algorithm is on-line with strong lookahead l if it sees the present request and a sequence of future requests that contains l pairwise distinct pages. These pages also differ from the page requested by the present request. We show that strong lookahead has practical as well as theoretical importance and significantly improves the competitive factors of on-line paging algorithms. This is the first model of lookahead having such properties. In addition to lower bounds we present a number of deterministic and randomized on-line paging algorithms with strong lookahead which are optimal or nearly optimal.

This work was done while the author was a student at the Graduiertenkolleg Informatik, Universität des Saarlandes, and was supported by a graduate fellowship of the Deutsche Forschungsgemeinschaft.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78–101, 1966.

    Google Scholar 

  2. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos and A. Wigderson. On the power of randomization in on-line algorithms. In Proc. 22nd Annual ACM Symposium on Theory of Computing, pages 379–386, 1990. To appear in Algorithmica.

    Google Scholar 

  3. F.K. Chung, R. Graham and M.E. Saks. A dynamic location problem for graphs. Combinatorica, 9(2):111–131, 1989.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. E. Grove. The harmonic online k-server algorithm is competitive. In Proc. 23nd Annual ACM Symposium on Theory of Computing, pages 260–266, 1991.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. S. Irani. Coloring inductive graphs on-line. In Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, pages 470–479, 1990.

    Google Scholar 

  8. M.-Y. Kao and S.R. Tate. Online matching with blocked input. Information Processing Letters, 38:113–116, May 1991.

    Google Scholar 

  9. A.R. Karlin, M.S. Manasse, L. Rudolph and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79–119, 1988.

    Google Scholar 

  10. M.S. Manasse, L.A. McGeoch and D.D. Sleator. Competitive algorithms for on-line problems. In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 322–333, 1988.

    Google Scholar 

  11. L.A. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816–825, 1991.

    Google Scholar 

  12. P. Raghavan. Lecture notes on randomized algorithms. IBM Research Report No. RC 15340 (# 68237), Yorktown Heights, 1989.

    Google Scholar 

  13. P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. In Proc. 16th International Colloquium on Automata, Languages and Programming, Springer Lecture Notes in Computer Science, Vol. 372, pages 687–703, 1989.

    Google Scholar 

  14. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202–208, 1985.

    Google Scholar 

  15. J.R. Spirn. Program Behavior: Models and Measurements. Elsevier, New York, 1977.

    Google Scholar 

  16. A.C.-C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 222–227, 1977.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, 66123, Saarbrücken, Germany

    Susanne Albers

Authors
  1. Susanne Albers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Lengauer

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albers, S. (1993). The influence of lookahead in competitive paging algorithms. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-57273-2_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57273-2

  • Online ISBN: 978-3-540-48032-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation