arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.05024cs.AR
收藏

使用期望命中计数使Belady启发的替换策略更有效

Making Belady-Inspired Replacement Policies More Effective Using Expected Hit Count

Seyed Armin Vakil Ghahani, Sara Mahdizadeh Shahri, Mohammad Bakhshalipour, Pejman Lotfi-Kamran, Hamid Sarbazi-Azad

摘要:

内存密集型工作负载处理大量数据,这些数据无法被现代处理器的末级缓存(LLC)捕获。因此,处理器会遇到频繁的片外未命中,因此,失去了显着的性能潜力。减少芯片外未命中的数量的一种方法是通过在LLC中使用行为良好的替换策略。现有的处理器采用最近最少使用(LRU)策略的变体来确定用于替换的牺牲品。不幸的是,有一个很大的差距,LRU提供和Belady的MIN,这是最佳的更换政策。Belady的MIN需要选择具有最长重用距离的受害者,因此,由于需要知道未来,因此是不可行的。因此,受Belady启发的替换策略使用Belady的MIN来导出一个指标,以帮助他们选择替换的受害者。在这项工作中,我们表明,在相当多的情况下,在最先进的贝拉迪启发的替换政策中使用的指标在挑选受害者时并不具有决定性,因此,该政策必须依赖于标准度量(例如,近因或频率)来挑选受害者,这是低效的。我们观察到,存在很强的相关性,在同一区域的内存中的缓存块的命中计数时,Belady的MIN是替换策略。利用这一观察,我们提出了一个预期的命中计数指标的内存区域,并使用它来改善受害者选择机制的Belady启发的替换政策时,主要指标是不决定性的。我们的建议提供了一个5.2\%的性能提高基线LRU和优于鹰眼,这是最先进的更换政策。

英文摘要:

Memory-intensive workloads operate on massive amounts of data that cannot be captured by last-level caches (LLCs) of modern processors. Consequently, processors encounter frequent off-chip misses, and hence, lose a significant performance potential. One way to reduce the number of off-chip misses is through using a well-behaved replacement policy in the LLC. Existing processors employ a variation of least recently used (LRU) policy to determine a victim for replacement. Unfortunately, there is a large gap between what LRU offers and that of Belady's MIN, which is the optimal replacement policy. Belady's MIN requires selecting a victim with the longest reuse distance, and hence, is unfeasible due to the need to know the future. Consequently, Belady-inspired replacement polices use Belady's MIN to derive an indicator to help them choose a victim for replacement. In this work, we show that the indicator that is used in the state-of-the-art Belady-inspired replacement policy is not decisive in picking a victim in a considerable number of cases, and hence, the policy has to rely on a standard metric (e.g., recency or frequency) to pick a victim, which is inefficient. We observe that there exist strong correlations among the hit counts of cache blocks in the same region of memory when Belady's MIN is the replacement policy. Taking advantage of this observation, we propose an expected-hit-count indicator for the memory regions and use it to improve the victim selection mechanism of Belady-inspired replacement policies when the main indicator is not decisive. Our proposal offers a 5.2\% performance improvement over the baseline LRU and outperforms Hawkeye, which is the state-of-the-art replacement policy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑