On Competitive On-Line Paging with Lookahead

Dany Breslauer
1995 BRICS Report Series  
This paper studies two methods for improving the competitive efficiency <br />of on-line paging algorithms: in the first, the on-line algorithm can<br />use more pages; in the second, it is allowed to have a look-ahead, or in<br />other words, some partial knowledge of the future. The paper considers a<br />new measure for the look-ahead size as well as Young's resource-bounded<br />look-ahead and proves that both measures have the attractive property<br />that the competitive efficiency of an
more » ... n-line algorithm with k extra pages<br />and look-ahead l depends on k+l. Hence, under these measures, an on-line<br />algorithm has the same benefit from using an extra page or knowing an<br />extra bit of the future.
doi:10.7146/brics.v2i50.19951 fatcat:mdsw63dwvjdqjkm3eukm5wg3xi