TY - GEN
T1 - Online generalized caching with varying weights and costs
AU - Even, Guy
AU - Medina, Moti
AU - Rawitz, Dror
N1 - Publisher Copyright:
© 2018 Association for Computing Machinery.
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 - Conference contribution
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 -