Uniform lease vs. LRU cache: analysis and evaluation
Uniform lease vs. LRU cache: analysis and evaluation
复制标题
DOI：
10.1145/3459898.3463908
复制
发表时间：
2021-06
期刊：
影响因子：
--
通讯作者：
Dong Chen;C. Ding;Fangzhou Liu;Ben Reber;Wesley Smith;Pengcheng Li
中科院分区：
文献类型：
--
作者：
Dong Chen;C. Ding;Fangzhou Liu;Ben Reber;Wesley Smith;Pengcheng Li
租用缓存是一种新技术，与传统缓存相比，它提供了更好的缓存控制。最简单的控制是统一租约 (UL)，这意味着所有租约的长度都相同。 UL 缓存是规定性的并且基于分配。相比之下，传统的缓存是反应性的并且基于替换。它们代表了两种根本不同的缓存管理方法。本文显示了两个结果。首先，它证明了先前称为高阶局部性理论 (HOTL) 的 LRU 缓存模型可以计算 UL 缓存的未命中率。其次，它通过人为的示例和 PolyBench 的 30 个基准测试展示了 UL 和 LRU 的表现如何相同和不同。
Lease caching is a new technique that provides greater control of the cache than what is allowed in conventional caches. The simplest control is uniform lease (UL), which means that all leases are identical in length. The UL cache is prescriptive and based on allocation. In comparison, a conventional cache is reactive and based on replacement. They represent two fundamentally different approaches to cache management. This paper shows two results. First, it proves that a previous model of the LRU cache called Higher-Order Theory of Locality (HOTL) computes the miss ratio of the UL cache. Second, it shows how UL and LRU behave the same and differently through contrived examples and in the 30 benchmarks of PolyBench.