TinyCache - An Effective Cache Admission Filter
TinyCache - An Effective Cache Admission Filter
复制标题
TinyCache - 有效的缓存准入过滤器
DOI：
10.1109/glocom.2017.8254701
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
R. Friedman
中科院分区：
文献类型：
--
作者：
Dolev Adas;Gil Einziger;R. Friedman
有效的caches管理策略应该在大量工作负载上提供良好的命中率，在恒定的时间内运行，并维护少量的元数据。在某些工作负载中，缓存稳定性是一个重要的指标，因为限制缓存更新的数量可以改善功耗，增加闪存的预期寿命，并在分布式设置中节省网络带宽。本文介绍了TinyCache，一种基于压缩表的高速缓存管理策略。TinyCache与领先的替代品相比实现了类似的命中率，同时在最坏情况下操作恒定时间，并且每次更新仅访问固定大小的内存字。TinyCache以内存优化的方式编码其元数据，与最先进的技术相比，减少了多达X6的缓存更新次数。
Effective management policies for datastore caches should provide good hit-ratios on a large number of workloads, operate in constant time, and maintain a small amount of metadata. In certain workloads, cache stability is an important metric, as limiting the number of cache updates can improve power consumption, increase the life expectancy of flash memories, and conserve network bandwidth in distributed settings. This paper introduces TinyCache, a compact table based management policy for datastore caches. TinyCache achieves similar hit ratio compared to the leading alternatives while operating in worst case constant time and only accessing a fixed sized memory word for each update. TinyCache encodes its metadata in a memory optimal manner and reduces the number of cache updates by up to X6 compared to state of the art.