引用本文:刘 利,陈 彧,乔 林,汤志忠.利用循环分割和循环展开避免Cache代价.软件学报,2008,19(9):2228-2242
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 5559次   下载 6915 本文二维码信息
码上扫一扫!
分享到: 微信 更多
利用循环分割和循环展开避免Cache代价
刘 利1, 陈 彧1, 乔 林1, 汤志忠1
清华大学 计算机科学与技术系,北京 100084
摘要:
存储系统与处理器之间的速度差距逐渐变大,为此,cache使用了分级机制,但这也带来了额外的存储延迟(cache代价).提出一种利用循环分割和循环展开相结合避免cache代价的PCPLPU(prevent cache penalty by loop partition-unrolling)算法.实验结果表明,PCPLPU算法能够有效避免循环代价,提高程序性能.
关键词:  循环分割  循环展开  cache代价  bank冲突
DOI:
分类号:
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60573100 (国家自然科学基金)
Optimization to Prevent Cache Penalty by Loop Partition and Loop Unrolling
LIU Li,CHEN Yu,QIAO Lin,TANG Zhi-Zhong
Abstract:
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.
Key words:  loop partition  loop unrolling  cache penalty  bank conflict