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

带租赁成本的缓存和切换

Caching with rental cost and zapping

Monik Khare, Neal E. Young

摘要:

\emph{file caching}问题定义如下。给定一个大小为$k$(正整数)的缓存,目标是最小化给定文件请求序列的总检索成本。文件$f$具有大小$size(f)$(正整数)和将文件放入缓存的检索成本$cost(f)$(非负数)。当所请求的文件不在高速缓存中,并且必须通过支付检索成本将文件检索到高速缓存中,并且可能必须从高速缓存中删除(\emph{evicted})某个其他文件,以使高速缓存中的文件的总大小不超过$k$时,发生\emph{miss}或\emph{fault}。我们研究了在线文件缓存问题的以下变体。\textbf{\emph{Caching with Rental Cost} (or \emph{Rental Caching})}:在每个时间单位,缓存中的每个文件都有一个租赁成本$λ$(正数)。我们的目标是最小化检索成本和租赁成本的总和。\textbf{\emph{Caching with Zapping}}:通过支付切换成本$N \ge 1$,文件可以是\emph{zapped}。一旦文件被清除,以后对该文件的所有请求都不会产生任何成本。我们的目标是最小化检索成本和切换成本之和。我们研究这两种变体以及结合这两种变体(带zapping的租赁缓存)。我们提出了确定性的下限和上限的竞争分析框架。研究并扩展了\citep{young02online}的在线覆盖算法,给出了确定性的在线覆盖算法.我们还提出了随机的下限和上限,其中一些问题。

英文摘要:

The \emph{file caching} problem is defined as follows. Given a cache of size $k$ (a positive integer), the goal is to minimize the total retrieval cost for the given sequence of requests to files. A file $f$ has size $size(f)$ (a positive integer) and retrieval cost $cost(f)$ (a non-negative number) for bringing the file into the cache. A \emph{miss} or \emph{fault} occurs when the requested file is not in the cache and the file has to be retrieved into the cache by paying the retrieval cost, and some other file may have to be removed (\emph{evicted}) from the cache so that the total size of the files in the cache does not exceed $k$. We study the following variants of the online file caching problem. \textbf{\emph{Caching with Rental Cost} (or \emph{Rental Caching})}: There is a rental cost $λ$ (a positive number) for each file in the cache at each time unit. The goal is to minimize the sum of the retrieval costs and the rental costs. \textbf{\emph{Caching with Zapping}}: A file can be \emph{zapped} by paying a zapping cost $N \ge 1$. Once a file is zapped, all future requests of the file don't incur any cost. The goal is to minimize the sum of the retrieval costs and the zapping costs. We study these two variants and also the variant which combines these two (rental caching with zapping). We present deterministic lower and upper bounds in the competitive-analysis framework. We study and extend the online covering algorithm from \citep{young02online} to give deterministic online algorithms. We also present randomized lower and upper bounds for some of these problems.

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

↑