Abstract.
We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging algorithm is n-line with strong lookahead l if it sees the present request and a sequence of future requests that contains l pairwise distinct pages. We show that strong lookahead has practical as well as theoretical importance and 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 8, 1994; revised May 15, 1995.
Rights and permissions
About this article
Cite this article
Albers, S. On the Influence of Lookahead in Competitive Paging Algorithms . Algorithmica 18, 283–305 (1997). https://doi.org/10.1007/PL00009158
Issue Date:
DOI: https://doi.org/10.1007/PL00009158