Online generalized caching with varying weights and costs

Guy Even, Moti Medina, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 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 languageEnglish
Title of host publicationSPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages205-212
Number of pages8
ISBN (Electronic)9781450357999
DOIs
StatePublished - 11 Jul 2018
Event30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 - Vienna, Austria
Duration: 16 Jul 201818 Jul 2018

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018
Country/TerritoryAustria
CityVienna
Period16/07/1818/07/18

Keywords

  • Caching
  • Competitive analysis
  • Online algorithms
  • Paging

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Online generalized caching with varying weights and costs'. Together they form a unique fingerprint.

Cite this