自适应访问模式的缓存替换策略

A Cache Replacement Policy Adapting to the Request Access Pattern

针对组竞争仅考虑访问请求序列的替换结果而没有考虑请求的访存特征这个问题,提出了基于堆栈距离频度的复杂加权法在线识别访问模式的方法以及自适应访问模式的缓存管理替换算法,基本思想是依据在线识别的访问请求模式特征自动调整其插入策略.在Simics中,对选自SPEC CPU2000/2006的18个测试程序及组合负载的实验结果表明,该算法的缺失率相对于DIP、RRIP、TADIP和PIPP都有显著降低.

Many proposals about the optimization of cache management policies depend on set dueling,and they choose policies according to the results of miss rates. However,they are facing challenges in multicore since they have lower accuracy and higher storage overhead. The main reason is that they only consider the results of cache replacement policies rather than the characteristic of cache access sequences（ or access pattern）. Therefore,an online access pattern identification method,complex stack distance weighting method was proposed,and an adaptive cache replacement policy,least recently used-C（ LRU-C）,was put forward. Its basic idea is to adjust the insertion position according to the result of the online access pattern identification. Experiment in the full-system Simics running 18 benchmarks from SPEC CPU2000 /2006 shows that the performance of LRU-C is better than those of dynamic insertion policy,re-reference interval prediction,thread aware dynamic insertion policy and promotion / insertion pseudo-partitioning.