On Competitive On-Line Paging with Lookahead
DOI:
https://doi.org/10.7146/brics.v2i50.19951Resumé
This paper studies two methods for improving the competitive efficiencyof on-line paging algorithms: in the first, the on-line algorithm can
use more pages; in the second, it is allowed to have a look-ahead, or in
other words, some partial knowledge of the future. The paper considers a
new measure for the look-ahead size as well as Young's resource-bounded
look-ahead and proves that both measures have the attractive property
that the competitive efficiency of an on-line algorithm with k extra pages
and look-ahead 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.
Downloads
Publiceret
1995-09-20
Citation/Eksport
Breslauer, D. (1995). On Competitive On-Line Paging with Lookahead. BRICS Report Series, 2(50). https://doi.org/10.7146/brics.v2i50.19951
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
