Finely-Competitive Paging

@inproceedings{Blum1999FinelyCompetitiveP,
  title={Finely-Competitive Paging},
  author={Avrim Blum and Carl Burch and Adam Tauman Kalai},
  booktitle={FOCS},
  year={1999}
}
We construct an online algorithm for paging that achieves anO(r + log k) competitive ratio when compared to an offline strategy that is allowed the additional ability to “rent” pages at a cost of1=r. In contrast, the competitive ratio of the Marking algorithm for this scenario isO(r log k). Our algorithm can be thought of in the standard setting as having a “fine-grained” competitive ratio, achieving an O(1) ratio when the request sequence consists of a small number of working sets, gracefully… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

57 Citations

0510'00'04'09'14'19
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…