Note
On competitive on-line paging with lookahead

https://doi.org/10.1016/S0304-3975(98)00118-2Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper studies two methods for improving the competitive efficiency of on-line paging algorithms: in the first, the on-line algorithm can use more pages; in the second, it is allowed to have a lookahead, or in other words, some partial knowledge of the future. The paper considers a new measure for the lookahead size as well as Young's resource-bounded lookahead and proves that both measures have the attractive property that the competitive efficiency of an on-line algorithm with k extra pages and lookahead l depends on k + l. Hence, under these measures, an on-line algorithm has the same benefit from using an extra page or knowing an extra bit of the future.

Keywords

On-line algorithms: Paging: Lookahead
Competitive analysis

Cited by (0)

1

Part of this work was carried out while the author was staying at BRICS — Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus, DK-8000 Aarhus C, Denmark. Partially supported by the ESPRIT Basic Research Action Program of the EC under contract #7141 (ALCOM II).

Copyright © 1998 Published by Elsevier B.V.