arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.14808cs.AR
收藏

利用缓存级别预测降低加载延迟

Reducing Load Latency with Cache Level Prediction

Majid Jalili, Mattan Erez

摘要:

深缓存层次结构和相对较慢的主内存导致的高负载延迟是单线程性能的重要限制因素。数据预取通过在加载指令请求数据之前沿层次结构向上获取数据来帮助减少此延迟。然而,数据预取在许多情况下是不完美的。我们提出缓存级预测,以补充预取。我们的方法预测哪一个存储层次结构级别的负载将访问允许内存加载开始较早,从而节省了许多周期。预测器提供了高预测精度,代价是L1未命中仅增加了一个周期的延迟。实验结果表明,加速7.8%的通用,图形和HPC应用程序的基线与积极的预取。

英文摘要:

High load latency that results from deep cache hierarchies and relatively slow main memory is an important limiter of single-thread performance. Data prefetch helps reduce this latency by fetching data up the hierarchy before it is requested by load instructions. However, data prefetching has shown to be imperfect in many situations. We propose cache-level prediction to complement prefetchers. Our method predicts which memory hierarchy level a load will access allowing the memory loads to start earlier, and thereby saves many cycles. The predictor provides high prediction accuracy at the cost of just one cycle added latency to L1 misses. Experimental results show speedup of 7.8\% on generic, graph, and HPC applications over a baseline with aggressive prefetchers.

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

↑