利用循环分割和循环展开避免Cache代价  

Optimization to Prevent Cache Penalty by Loop Partition and Loop Unrolling

作　　者：刘利[1] 陈彧[1] 乔林[1] 汤志忠[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《软件学报》2008年第9期2228-2242,共15页Journal of Software

基　　金：国家自然科学基金~~

摘　　要：存储系统与处理器之间的速度差距逐渐变大,为此,cache使用了分级机制,但这也带来了额外的存储延迟(cache代价).提出一种利用循环分割和循环展开相结合避免cache代价的PCPLPU(prevent cache penalty by loop partition-unrolling)算法.实验结果表明,PCPLPU算法能够有效避免循环代价,提高程序性能.Due to the increasing speed gap between memory system and processor, cache hierarchies have been implemented into memory system, but additional latency （cache penalty） is introduced. This paper presents an algorithm named as prevent cache penalty by loop partition-unrolling （PCPLPU）, which can prevent cache penalty in loops by the combination of loop partition and unrolling. Experimental results show that PCPLPU can prevent cache penalty and improve the performance of programs.

关 键 词：循环分割 循环展开 cache代价 bank冲突 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]