{"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.