CRP: Context-directed Replacement Policy to Improve Cache Performance for Coarse-Grained Reconfigurable Arrays

Chen Yang, Jia Hou, Yizhou Wang, Li Geng
{"title":"CRP: Context-directed Replacement Policy to Improve Cache Performance for Coarse-Grained Reconfigurable Arrays","authors":"Chen Yang, Jia Hou, Yizhou Wang, Li Geng","doi":"10.1109/ICECS49266.2020.9294864","DOIUrl":null,"url":null,"abstract":"This paper proposed a context-directed replacement policy (CRP) to improve cache hit rate for Coarse-grained reconfigurable arrays (CGRA). CRP updates the replacement priority according to the usage rate of configuration contexts. Once finding two candidates of configuration contexts with the highest replacement priority, CRP reserves the larger context in cache and evict the smaller one. Using five different access patterns as benchmark, experimental results show that CRP outperforms LRU and RRIP replacement policies, especially for scan and mixed access patterns. Under the test of random access sequence, CRP can averagely improve cache hit rate by 36% and 20%, compared to RRIP and LRU, respectively.","PeriodicalId":404022,"journal":{"name":"2020 27th IEEE International Conference on Electronics, Circuits and Systems (ICECS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 27th IEEE International Conference on Electronics, Circuits and Systems (ICECS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECS49266.2020.9294864","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposed a context-directed replacement policy (CRP) to improve cache hit rate for Coarse-grained reconfigurable arrays (CGRA). CRP updates the replacement priority according to the usage rate of configuration contexts. Once finding two candidates of configuration contexts with the highest replacement priority, CRP reserves the larger context in cache and evict the smaller one. Using five different access patterns as benchmark, experimental results show that CRP outperforms LRU and RRIP replacement policies, especially for scan and mixed access patterns. Under the test of random access sequence, CRP can averagely improve cache hit rate by 36% and 20%, compared to RRIP and LRU, respectively.
上下文导向的替换策略提高粗粒度可重构数组的缓存性能
为了提高粗粒度可重构数组(CGRA)的缓存命中率,提出了一种上下文导向的替换策略(CRP)。CRP根据配置上下文的使用率更新替换优先级。一旦找到两个具有最高替换优先级的配置上下文候选,CRP就在缓存中保留较大的上下文,并驱逐较小的上下文。以五种不同的访问模式为基准,实验结果表明,CRP优于LRU和RRIP替换策略,特别是在扫描和混合访问模式下。在随机访问序列测试下,CRP比RRIP和LRU平均提高缓存命中率分别为36%和20%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信