Buying a constant competitive ratio for paging

J. Csirik, Csanád Imreh, John Noga, Steve S. Seiden, Gerhard J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We consider a variant of the online paging problem where the online algorithm may buy additional cache slots at a certain cost. The overall cost incurred equals the total cost for the cache plus the number of page faults. This problem and our results are a generalization of both, the classical paging problem and the ski rental problem. We derive the following three tight results: (1) For the case where the cache cost depends linearly on the cache size, we give a λ-competitive online algorithm where λ ≈ 3:14619 is a solution of λ = 2 + ln λ. This competitive ratio λ is best possible. (2) For the case where the cache cost grows like a polynomial of degree d in the cache size, we give an online algorithm whose competitive ratio behaves like d/ ln d + o(d/ ln d). No online algorithm can reach a competitive ratio better than d/ ln d. (3) We exactly characterize the class of cache cost functions for which there exist online algorithms with finite competitive ratios.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages98-108
Number of pages11
Volume2161
ISBN (Print)9783540424932
Publication statusPublished - 2001
Event9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark
Duration: Aug 28 2001Aug 31 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2161
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other9th Annual European Symposium on Algorithms, ESA 2001
CountryDenmark
CityArhus
Period8/28/018/31/01

Fingerprint

Paging
Competitive Ratio
Cache
Online Algorithms
Costs
Cost functions
Order of a polynomial
Polynomials
Cost Function
Fault
Linearly

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Csirik, J., Imreh, C., Noga, J., Seiden, S. S., & Woeginger, G. J. (2001). Buying a constant competitive ratio for paging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2161, pp. 98-108). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161). Springer Verlag.

Buying a constant competitive ratio for paging. / Csirik, J.; Imreh, Csanád; Noga, John; Seiden, Steve S.; Woeginger, Gerhard J.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2161 Springer Verlag, 2001. p. 98-108 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2161).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Csirik, J, Imreh, C, Noga, J, Seiden, SS & Woeginger, GJ 2001, Buying a constant competitive ratio for paging. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2161, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2161, Springer Verlag, pp. 98-108, 9th Annual European Symposium on Algorithms, ESA 2001, Arhus, Denmark, 8/28/01.
Csirik J, Imreh C, Noga J, Seiden SS, Woeginger GJ. Buying a constant competitive ratio for paging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2161. Springer Verlag. 2001. p. 98-108. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Csirik, J. ; Imreh, Csanád ; Noga, John ; Seiden, Steve S. ; Woeginger, Gerhard J. / Buying a constant competitive ratio for paging. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2161 Springer Verlag, 2001. pp. 98-108 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b87895bfc4e241b8b8e55f7bb1890a21,
title = "Buying a constant competitive ratio for paging",
abstract = "We consider a variant of the online paging problem where the online algorithm may buy additional cache slots at a certain cost. The overall cost incurred equals the total cost for the cache plus the number of page faults. This problem and our results are a generalization of both, the classical paging problem and the ski rental problem. We derive the following three tight results: (1) For the case where the cache cost depends linearly on the cache size, we give a λ-competitive online algorithm where λ ≈ 3:14619 is a solution of λ = 2 + ln λ. This competitive ratio λ is best possible. (2) For the case where the cache cost grows like a polynomial of degree d in the cache size, we give an online algorithm whose competitive ratio behaves like d/ ln d + o(d/ ln d). No online algorithm can reach a competitive ratio better than d/ ln d. (3) We exactly characterize the class of cache cost functions for which there exist online algorithms with finite competitive ratios.",
author = "J. Csirik and Csan{\'a}d Imreh and John Noga and Seiden, {Steve S.} and Woeginger, {Gerhard J.}",
year = "2001",
language = "English",
isbn = "9783540424932",
volume = "2161",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "98--108",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Buying a constant competitive ratio for paging

AU - Csirik, J.

AU - Imreh, Csanád

AU - Noga, John

AU - Seiden, Steve S.

AU - Woeginger, Gerhard J.

PY - 2001

Y1 - 2001

N2 - We consider a variant of the online paging problem where the online algorithm may buy additional cache slots at a certain cost. The overall cost incurred equals the total cost for the cache plus the number of page faults. This problem and our results are a generalization of both, the classical paging problem and the ski rental problem. We derive the following three tight results: (1) For the case where the cache cost depends linearly on the cache size, we give a λ-competitive online algorithm where λ ≈ 3:14619 is a solution of λ = 2 + ln λ. This competitive ratio λ is best possible. (2) For the case where the cache cost grows like a polynomial of degree d in the cache size, we give an online algorithm whose competitive ratio behaves like d/ ln d + o(d/ ln d). No online algorithm can reach a competitive ratio better than d/ ln d. (3) We exactly characterize the class of cache cost functions for which there exist online algorithms with finite competitive ratios.

AB - We consider a variant of the online paging problem where the online algorithm may buy additional cache slots at a certain cost. The overall cost incurred equals the total cost for the cache plus the number of page faults. This problem and our results are a generalization of both, the classical paging problem and the ski rental problem. We derive the following three tight results: (1) For the case where the cache cost depends linearly on the cache size, we give a λ-competitive online algorithm where λ ≈ 3:14619 is a solution of λ = 2 + ln λ. This competitive ratio λ is best possible. (2) For the case where the cache cost grows like a polynomial of degree d in the cache size, we give an online algorithm whose competitive ratio behaves like d/ ln d + o(d/ ln d). No online algorithm can reach a competitive ratio better than d/ ln d. (3) We exactly characterize the class of cache cost functions for which there exist online algorithms with finite competitive ratios.

UR - http://www.scopus.com/inward/record.url?scp=84943233742&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84943233742&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540424932

VL - 2161

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 98

EP - 108

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -