Prefetching and caching for minimizing service costs: Optimal and approximation strategies
Prefetching and caching for minimizing service costs: Optimal and approximation strategies
复制标题
预取和缓存以最大限度地降低服务成本：最优和近似策略
DOI：
10.1016/j.peva.2020.102149
复制
发表时间：
2021
影响因子：
2.2
通讯作者：
Shroff, Ness
中科院分区：
文献类型：
--
作者：
Quan, Guocong;Eryilmaz, Atilla;Tan, Jian;Shroff, Ness
在实践中，策略性地使用预取数据来提高缓存性能。其想法是，数据项可以在请求时缓存(传统方法)，或者在请求实际发生之前预取到缓存中。缓存和预取操作争夺有限的缓存空间，缓存空间的大小通常比数据项的数量小得多。一个关键的挑战是设计一个最优的预取和缓存策略，假设未来的请求可以在一定程度上被预测。即使在未来请求是精确已知的理想化假设下，这也不是一个微不足道的挑战。
In practice, prefetching data strategically has been used to improve caching performance. The idea is that data items can either be cached upon request (traditional approach) or prefetched into the cache before the requests actually occur. The caching and prefetching operations compete for the limited cache space, whose size is typically much smaller than the number of data items. A key challenge is to design an optimal prefetching and caching policy, assuming that the future requests can be predicted to a certain extent. This is a non-trivial challenge even under the idealized assumption that future requests are precisely known.