Online generalized caching with varying weights and costs

Guy Even; Moti Medina; Dror Rawitz

doi:10.1145/3210377.3210404

Online generalized caching with varying weights and costs

Guy Even, Moti Medina, Dror Rawitz

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

We present a new extension of the generalized caching/paging problem that allows the adversary to arbitrarily change the cost or weight of the currently requested page. We present modifications of previous algorithms for generalized caching to handle varying page weights and page costs. In particular, a deterministic algorithm based on [5, 9] for an (h, k)-competitive algorithm with competitive ratio k/(k − h + 1) is presented. In addition, a randomized algorithm based on [1, 2] with competitive ratio O(log k) is presented. We present three applications that can be supported via reductions to generalized caching with varying page weights and page costs. These applications are: (1) support of subsets of pages that must be simultaneously present in the cache before entry to a critical section (i.e., working sets), (2) change of page size due to compression and decompression, (3) variable cache size (i.e., elastic caches).

Original language	English
Title of host publication	SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher	Association for Computing Machinery
Pages	205-212
Number of pages	8
ISBN (Electronic)	9781450357999
DOIs	https://doi.org/10.1145/3210377.3210404
State	Published - 11 Jul 2018
Event	30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 - Vienna, Austria Duration: 16 Jul 2018 → 18 Jul 2018

Publication series

Name	Annual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference	30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018
Country/Territory	Austria
City	Vienna
Period	16/07/18 → 18/07/18

Bibliographical note

Publisher Copyright:
© 2018 Association for Computing Machinery.

Funding

∗This research was supported by a grant from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel, and the United States Science Foundation (NSF). †Supported in part by the Israel Science Foundation (grant no. 497/14). The authors would like to thank Marcin Bienkowski and Gil Einziger for useful discussions. Part of this work was done while the authors were visiting the Max Planck Institute for Informatics.

Funders	Funder number
United States-Israel Binational Science Foundation
Israel Science Foundation	497/14

Keywords

Caching
Competitive analysis
Online algorithms
Paging

Access to Document

10.1145/3210377.3210404

Cite this

@inproceedings{a2bddf35180c4c449b2d4a325973437d,

title = "Online generalized caching with varying weights and costs",

abstract = "We present a new extension of the generalized caching/paging problem that allows the adversary to arbitrarily change the cost or weight of the currently requested page. We present modifications of previous algorithms for generalized caching to handle varying page weights and page costs. In particular, a deterministic algorithm based on [5, 9] for an (h, k)-competitive algorithm with competitive ratio k/(k − h + 1) is presented. In addition, a randomized algorithm based on [1, 2] with competitive ratio O(log k) is presented. We present three applications that can be supported via reductions to generalized caching with varying page weights and page costs. These applications are: (1) support of subsets of pages that must be simultaneously present in the cache before entry to a critical section (i.e., working sets), (2) change of page size due to compression and decompression, (3) variable cache size (i.e., elastic caches).",

keywords = "Caching, Competitive analysis, Online algorithms, Paging",

author = "Guy Even and Moti Medina and Dror Rawitz",

note = "Publisher Copyright: {\textcopyright} 2018 Association for Computing Machinery.; 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 ; Conference date: 16-07-2018 Through 18-07-2018",

year = "2018",

month = jul,

day = "11",

doi = "10.1145/3210377.3210404",

language = "אנגלית",

series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

publisher = "Association for Computing Machinery",

pages = "205--212",

booktitle = "SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures",

}

Even, G, Medina, M & Rawitz, D 2018, Online generalized caching with varying weights and costs. in SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, pp. 205-212, 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, 16/07/18. https://doi.org/10.1145/3210377.3210404

Online generalized caching with varying weights and costs. / Even, Guy; Medina, Moti ; Rawitz, Dror.
SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, 2018. p. 205-212 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Online generalized caching with varying weights and costs

AU - Even, Guy

AU - Medina, Moti

AU - Rawitz, Dror

PY - 2018/7/11

Y1 - 2018/7/11

N2 - We present a new extension of the generalized caching/paging problem that allows the adversary to arbitrarily change the cost or weight of the currently requested page. We present modifications of previous algorithms for generalized caching to handle varying page weights and page costs. In particular, a deterministic algorithm based on [5, 9] for an (h, k)-competitive algorithm with competitive ratio k/(k − h + 1) is presented. In addition, a randomized algorithm based on [1, 2] with competitive ratio O(log k) is presented. We present three applications that can be supported via reductions to generalized caching with varying page weights and page costs. These applications are: (1) support of subsets of pages that must be simultaneously present in the cache before entry to a critical section (i.e., working sets), (2) change of page size due to compression and decompression, (3) variable cache size (i.e., elastic caches).

AB - We present a new extension of the generalized caching/paging problem that allows the adversary to arbitrarily change the cost or weight of the currently requested page. We present modifications of previous algorithms for generalized caching to handle varying page weights and page costs. In particular, a deterministic algorithm based on [5, 9] for an (h, k)-competitive algorithm with competitive ratio k/(k − h + 1) is presented. In addition, a randomized algorithm based on [1, 2] with competitive ratio O(log k) is presented. We present three applications that can be supported via reductions to generalized caching with varying page weights and page costs. These applications are: (1) support of subsets of pages that must be simultaneously present in the cache before entry to a critical section (i.e., working sets), (2) change of page size due to compression and decompression, (3) variable cache size (i.e., elastic caches).

KW - Caching

KW - Competitive analysis

KW - Online algorithms

KW - Paging

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

U2 - 10.1145/3210377.3210404

DO - 10.1145/3210377.3210404

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85053485117

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 205

EP - 212

BT - SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures

PB - Association for Computing Machinery

T2 - 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018

Y2 - 16 July 2018 through 18 July 2018

ER -

Online generalized caching with varying weights and costs

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this