基于复用距离的cache失效率分析

Reuse Distance Based Cache Miss Rate Analysis

复用距离已经成为程序cache行为的一种重要度量标准,但高复杂度和可能的内存溢出问题使得其难以应用.本文在引入最大cache大小的基础上提出一种受限的复用距离分析方法.该方法有效地避免了一般复用距离分析可能导致的内存溢出问题,同时使得复用距离分析达到线性时间复杂度.文章通过对一系列整数和浮点程序的实验说明基于该复用距离分析的cache失效率分析的可行性和正确性.

Reuse distance has become an important metric of program cache behavior, but high complexity and possible memory overflow problem make its using difficult. Considering max cache size, this paper introduces a limited reuse distance analysis method. This method avoids possible memory overflow problem in normal reuse distance analysis, at the same time this method makes complexity of reuse distance analysis decrease to linear. Experiments from some integer and floatlng-point programs show it is feasible and correct that cache miss rate is analyzed by this reuse distance analysis.