arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.05975cs.DS
收藏

使用预备役缓存

Caching with Reserves

Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua Wang

摘要:

高速缓存是许多计算机系统的重要组成部分,因此它自然是算法设计中的一个深入研究的主题。许多传统的缓存研究都是针对单用户或单处理器环境研究缓存管理。在本文中,我们提出了两个相关的概括的经典缓存问题,捕捉在多用户或多处理器环境中出现的问题。在具有保留的高速缓存问题中,对于某些给定的保留容量$k_i$,要求高速缓存算法在任何时候在高速缓存中至少维护属于用户$i$的$k_i$页面。在公共-私有缓存问题中,总大小为$k$的缓存被划分为子缓存、大小为$k_i$的私有缓存(用于每个用户$i$)和可由任何用户使用的共享公共缓存。在这两个模型中,在经典的缓存框架,算法的目标是动态地维护缓存,以尽量减少缓存未命中的总数。我们表明,缓存与储备和公共-私有缓存模型是等价的常数因子,因此专注于前者。与经典的缓存不同,这两种模型即使在离线设置中也是NP难的,在离线设置中页面序列是预先已知的。对于离线设置,我们设计了一个2-近似算法,其分析仔细跟踪潜在的功能,以限制成本。在在线环境中,我们首先设计了一个$O(\ln k)$ -竞争分数算法使用原始-对偶框架,然后展示了如何在线转换成一个随机积分算法具有相同的保证。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑