MAPS: Understanding Metadata Access Patterns in Secure Memory
MAPS: Understanding Metadata Access Patterns in Secure Memory
复制标题
DOI：
10.1109/ispass.2018.00012
复制
发表时间：
2018-04
期刊：
影响因子：
--
通讯作者：
T. Lehman;Andrew D. Hilton;Benjamin C. Lee
中科院分区：
文献类型：
--
作者：
T. Lehman;Andrew D. Hilton;Benjamin C. Lee
安全存储器增加了存储器访问所需的延迟和能量。为了减少这些开销，计算机架构师试图将元数据缓存在处理器芯片上，但是将元数据放置在简单的缓存中并不像预期的那样有效。通过对元数据访问模式的详细分析，我们澄清了元数据缓存中的神话，并深入了解了更有效的缓存策略。我们提供了三个意见，可以帮助架构师设计未来的元数据缓存。首先，缓存所有元数据类型可以提高效率。其次，元数据缓存的大小应该与元数据的重用距离相匹配。第三，当设计一个更好的驱逐政策，传统的Belady的MIN算法不能被用作最优替换策略。
Secure memory increases both the latency and energy required for memory accesses. To reduce these overheads, computer architects have sought to cache metadata on the processor chip, but placing metadata in a simple cache has not been as effective as expected. With a detailed analysis of metadata access patterns, we clarify myths in metadata caching and provide insight into more efficient caching strategies. We provide three observations that can help architects design future metadata caches. First, caching all metadata types improves efficiency. Second, the size of the metadata cache should match the reuse distance of the metadata. Third, when designing a better eviction policy, the traditional Belady's MIN algorithm cannot be used as the optimal replacement policy.