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

Cache中数据放置的子集分配问题

The Subset Assignment Problem for Data Placement in Caches

Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam

摘要:

我们介绍了子集分配问题,其中不同大小的项目被放置在一组有限容量的箱子。物品可以复制并放置在箱子的任何子集中。每个(项目,子集)对都有一个相关的成本。一般来说,不将物品分配到任何垃圾箱都不是免费的,并且可能是最昂贵的选择。目标是在不超过箱子容量的情况下,最小化将项目分配给子集的总成本。这个问题的动机是由不同的成本/性能规格的内存银行组成的高速缓存系统的设计。在多于一个存储体中复制数据项的能力可以在存储器故障的情况下以更快的恢复时间有益于系统的整体性能。对于该设置,数据对象(项)的数量$n$非常大,并且存储体(箱)的数量$d$是小常数(大约为$3$或$4$)。因此,目标是确定最佳时间分配,使对$n$的依赖性最小化。这个问题的积分版本是NP难的,因为它是背包问题的推广。我们专注于一个有效的解决方案,LP松弛分数分配的项目的数量将最多$d$。如果数据对象相对于存储体的大小较小,则从高速缓存中排除部分分配的数据项的效果将较小。我们给出了一个算法,解决了LP松弛和运行在时间$O({3^d \choose d+1} \text{poly}(d) n \log(n) \log(nC) \log(Z))$,其中$Z$是最大的项目大小和$C$的最大存储成本。

英文摘要:

We introduce the subset assignment problem in which items of varying sizes are placed in a set of bins with limited capacity. Items can be replicated and placed in any subset of the bins. Each (item, subset) pair has an associated cost. Not assigning an item to any of the bins is not free in general and can potentially be the most expensive option. The goal is to minimize the total cost of assigning items to subsets without exceeding the bin capacities. This problem is motivated by the design of caching systems composed of banks of memory with varying cost/performance specifications. The ability to replicate a data item in more than one memory bank can benefit the overall performance of the system with a faster recovery time in the event of a memory failure. For this setting, the number $n$ of data objects (items) is very large and the number $d$ of memory banks (bins) is a small constant (on the order of $3$ or $4$). Therefore, the goal is to determine an optimal assignment in time that minimizes dependence on $n$. The integral version of this problem is NP-hard since it is a generalization of the knapsack problem. We focus on an efficient solution to the LP relaxation as the number of fractionally assigned items will be at most $d$. If the data objects are small with respect to the size of the memory banks, the effect of excluding the fractionally assigned data items from the cache will be small. We give an algorithm that solves the LP relaxation and runs in time $O({3^d \choose d+1} \text{poly}(d) n \log(n) \log(nC) \log(Z))$, where $Z$ is the maximum item size and $C$ the maximum storage cost.

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

↑