Caching with Reserves

by   Sharat Ibrahimpur, et al.

Caching is a crucial component of many computer systems, so naturally it is a well-studied topic in algorithm design. Much of traditional caching research studies cache management for a single-user or single-processor environment. In this paper, we propose two related generalizations of the classical caching problem that capture issues that arise in a multi-user or multi-processor environment. In the caching with reserves problem, a caching algorithm is required to maintain at least k_i pages belonging to user i in the cache at any time, for some given reserve capacities k_i. In the public-private caching problem, the cache of total size k is partitioned into subcaches, a private cache of size k_i for each user i and a shared public cache usable by any user. In both of these models, as in the classical caching framework, the objective of the algorithm is to dynamically maintain the cache so as to minimize the total number of cache misses. We show that caching with reserves and public-private caching models are equivalent up to constant factors, and thus focus on the former. Unlike classical caching, both of these models turn out to be NP-hard even in the offline setting, where the page sequence is known in advance. For the offline setting, we design a 2-approximation algorithm, whose analysis carefully keeps track of a potential function to bound the cost. In the online setting, we first design an O(ln k)-competitive fractional algorithm using the primal-dual framework, and then show how to convert it online to a randomized integral algorithm with the same guarantee.


page 1

page 2

page 3

page 4


Efficient Caching with Reserves via Marking

Online caching is among the most fundamental and well-studied problems i...

Optimal Online Algorithms for File-Bundle Caching and Generalization to Distributed Caching

We consider a generalization of the standard cache problem called file-b...

A Secretive Coded Caching for Shared Cache Systems using PDAs

This paper considers the secretive coded caching problem with shared cac...

Beyond Worst-case Analysis of Multicore Caching Strategies

Every processor with multiple cores sharing a cache needs to implement a...

On Optimal Caching and Model Multiplexing for Large Model Inference

Large Language Models (LLMs) and other large foundation models have achi...

Lower Bounds for Caching with Delayed Hits

Caches are a fundamental component of latency-sensitive computer systems...

A Hybrid Cache Architecture for Meeting Per-Tenant Performance Goals in a Private Cloud

The in-memory cache system is an important component in a cloud for the ...

Please sign up or login with your details

Forgot password? Click here to reset