消除低重用块和预测访问间隔的Cache管理策略

Manage Last Level Cache with Eliminating Less Reused Blocks and Re-reference Interval Prediction Policy

设计一种被称之为消除低重用块和预测访问间隔的Cache管理策略ELRRIP.根据多核处理器的共享最后一级高速缓存中低重用块占用资源时间较长这一特点,ELRRIP策略:1)通过感知最后一级共享高速缓存的上一级Cache中的数据历史访问信息预测出低重用块并优先将其淘汰;2)通过改进的访问间隔预测技术预测出潜在的低重用块并将其优先淘汰.同时,本文还基于ELRRIP提出了TADELRRIP.实验表明,对于4核多核处理器而言,TADELRRIP可以将加权加速比平均提高9.14%.

The low utility data block wastes too many shared last level cache（LLC） resources of chip multi-processors（CMP）.In this paper,we propose an Eliminating Less Reused Blocks and Re-Reference Interval Prediction Policy（ELRRIP） to solve the problem.ELRRIP can get the data reference information of its previous level cache.Then it predicts the low utility data block according to the information and evict them as early as possible.ELRRIP uses improved Re-Reference Interval Prediction Policy to predict potential low utility data block and tries its best to evict them as early as possible.We also proposed TADELRRIP to manage LLC more efficiently.Our evaluation on 4-way CMPs shows that TADELRRIP improves the overall performance by 9.14% on average over the LRU policy.