摘要
循环分块是一种提高循环 Cache命中率的循环变换技术 ,循环分块的大小是决定循环分块效率的关键因素 .CME(cache miss equations)是一种精确分析程序中循环 Cache命中率的数学模型 ,从 CME理论模型出发 ,通过比较循环分块前后 CME的变化 ,结合 PADDING技术可以得出一个循环分块算法 .实验表明 ,通过该算法计算出的分块大小较之经典的 L RW循环分块算法 ,在确保完全消除循环中数组引用数据访问 Cache自冲突的同时 ,可以获得更大的分块 ,从而提高了循环分块的分块效率 .
Loop tiling is a kind of loop transformation technology to improve the cache hit rate of loops, and the size of tiling is the key factor of its efficiency. CME (cache miss equations) is a kind of math framework which can accurately analyse the cache hit rate of the loops in program. Based on the theory model of CME, by comparing the changes of CME before and after the loop tiling and by being combined with the PADDING technology, a new loop tiling algorithm can be gained. The experiment result shows that the new tiling algorithm, which ensures eliminating self-conflict cache miss of array reference data access in the loop totally, can obtain larger tiling size than the classical tiling algorithm-LRW, thus improving the efficiency of tiling.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2002年第10期1303-1306,共4页
Journal of Computer Research and Development
基金
国家自然科学基金资助 (10 0 72 0 77)
