Forskning ved Københavns Universitet - Københavns Universitet

Forside

An O(log k)-Competitive Algorithm for Generalized Caching

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Standard

An O(log k)-Competitive Algorithm for Generalized Caching. / Adamaszek, Anna; Czumaj, Artur; Englert, Matthias; Räcke, Harald.

I: ACM Transactions on Algorithms, Bind 15, Nr. 1, 6, 16.11.2018, s. 1-18.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Harvard

Adamaszek, A, Czumaj, A, Englert, M & Räcke, H 2018, 'An O(log k)-Competitive Algorithm for Generalized Caching', ACM Transactions on Algorithms, bind 15, nr. 1, 6, s. 1-18. https://doi.org/10.1145/3280826

APA

Adamaszek, A., Czumaj, A., Englert, M., & Räcke, H. (2018). An O(log k)-Competitive Algorithm for Generalized Caching. ACM Transactions on Algorithms, 15(1), 1-18. [6]. https://doi.org/10.1145/3280826

Vancouver

Adamaszek A, Czumaj A, Englert M, Räcke H. An O(log k)-Competitive Algorithm for Generalized Caching. ACM Transactions on Algorithms. 2018 nov 16;15(1):1-18. 6. https://doi.org/10.1145/3280826

Author

Adamaszek, Anna ; Czumaj, Artur ; Englert, Matthias ; Räcke, Harald. / An O(log k)-Competitive Algorithm for Generalized Caching. I: ACM Transactions on Algorithms. 2018 ; Bind 15, Nr. 1. s. 1-18.

Bibtex

@article{53c4449abbc74350a9d05371cb9b6714,
title = "An O(log k)-Competitive Algorithm for Generalized Caching",
abstract = "In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size wp≥ 1 and fetching cost cp for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k. The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loaded into the cache, incurring a cost of cp.We give a randomized O(log k)-competitive online algorithm for the generalized caching problem, improving the previous bound of O(log2 k) by Bansal, Buchbinder, and Naor (STOC’08). This improved bound is tight and of the same order as the known bounds for the classic paging problem with uniform weights and sizes. We use the same LP-based techniques as Bansal et al. but provide improved and slightly simplified methods for rounding fractional solutions online.",
author = "Anna Adamaszek and Artur Czumaj and Matthias Englert and Harald R{\"a}cke",
year = "2018",
month = "11",
day = "16",
doi = "10.1145/3280826",
language = "English",
volume = "15",
pages = "1--18",
journal = "A C M Transactions on Algorithms",
issn = "1549-6325",
publisher = "Association for Computing Machinery, Inc.",
number = "1",

}

RIS

TY - JOUR

T1 - An O(log k)-Competitive Algorithm for Generalized Caching

AU - Adamaszek, Anna

AU - Czumaj, Artur

AU - Englert, Matthias

AU - Räcke, Harald

PY - 2018/11/16

Y1 - 2018/11/16

N2 - In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size wp≥ 1 and fetching cost cp for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k. The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loaded into the cache, incurring a cost of cp.We give a randomized O(log k)-competitive online algorithm for the generalized caching problem, improving the previous bound of O(log2 k) by Bansal, Buchbinder, and Naor (STOC’08). This improved bound is tight and of the same order as the known bounds for the classic paging problem with uniform weights and sizes. We use the same LP-based techniques as Bansal et al. but provide improved and slightly simplified methods for rounding fractional solutions online.

AB - In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size wp≥ 1 and fetching cost cp for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k. The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loaded into the cache, incurring a cost of cp.We give a randomized O(log k)-competitive online algorithm for the generalized caching problem, improving the previous bound of O(log2 k) by Bansal, Buchbinder, and Naor (STOC’08). This improved bound is tight and of the same order as the known bounds for the classic paging problem with uniform weights and sizes. We use the same LP-based techniques as Bansal et al. but provide improved and slightly simplified methods for rounding fractional solutions online.

U2 - 10.1145/3280826

DO - 10.1145/3280826

M3 - Journal article

VL - 15

SP - 1

EP - 18

JO - A C M Transactions on Algorithms

JF - A C M Transactions on Algorithms

SN - 1549-6325

IS - 1

M1 - 6

ER -

ID: 218357505