Access-Time Aware Cache Algorithms
Access-Time Aware Cache Algorithms
复制标题
访问时间感知缓存算法
DOI：
10.1145/3149001
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Dimitra Tsigkari
中科院分区：
文献类型：
--
作者：
G. Neglia;D. Carra;M. Feng;V. Janardhan;Pietro Michiardi;Dimitra Tsigkari
大多数缓存算法都忽略了请求的时间尺度，但是缓存系统的容量受到限制，在实际情况下，命中率可能受到缓存不可能快速服务请求的限制。特别是，硬盘访问时间可以是关键因素封端缓存性能。在本文中，我们提出了一种新的缓存替换策略，该策略利用了层次的缓存体系结构，尤其是内存和磁盘之间的访问时间差。当请求遵循独立参考模型时，我们的策略是最佳的，并大大减少了硬盘负载，如我们现实，痕量驱动的评估所示。
Most of the caching algorithms are oblivious to requests' timescale, but caching systems are capacity constrained and, in practical cases, the hit rate may be limited by the cache's impossibility to serve requests fast enough. In particular, the hard-disk access time can be the key factor capping cache performances. In this paper, we present a new cache replacement policy that takes advantage of a hierarchical caching architecture, and in particular of access-time difference between memory and disk. Our policy is optimal when requests follow the independent reference model, and significantly reduces the hard-disk load, as shown also by our realistic, trace-driven evaluation.