Liu Jian, Leibo Liu, Yanan Lu, Jianfeng Zhu, Shaojun Wei
{"title":"Comparing Branch Predictors for Distributed-Controlled Coarse-Grained Reconfigurable Arrays","authors":"Liu Jian, Leibo Liu, Yanan Lu, Jianfeng Zhu, Shaojun Wei","doi":"10.1109/ICCSN.2019.8905283","DOIUrl":null,"url":null,"abstract":"Coarse-Grained Reconfigurable Array (CGRA) is a kind of spatial architecture that can achieve high parallelism. However, the control flow between instructions limits the parallelism and introduces pipeline stalls, significantly degrading the performance of the applications with intensive control flows. So, branch prediction is indispensable. Since CGRAs are composed of many processing elements (PEs) and the pipeline in a PE is not as deep as that in traditional processors, the branch predictors need to be reappraised. In this paper, we propose a hybrid branch predictor for CGRAs by exploiting the advantages of two complementary branch predictors. The result shows that the hybrid predictor performs best among all the predictors in the experiment. The hybrid predictor improves prediction accuracy by 4.48% compared with the bimodal predictor which is used in a latest CGRA related research.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2019.8905283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Coarse-Grained Reconfigurable Array (CGRA) is a kind of spatial architecture that can achieve high parallelism. However, the control flow between instructions limits the parallelism and introduces pipeline stalls, significantly degrading the performance of the applications with intensive control flows. So, branch prediction is indispensable. Since CGRAs are composed of many processing elements (PEs) and the pipeline in a PE is not as deep as that in traditional processors, the branch predictors need to be reappraised. In this paper, we propose a hybrid branch predictor for CGRAs by exploiting the advantages of two complementary branch predictors. The result shows that the hybrid predictor performs best among all the predictors in the experiment. The hybrid predictor improves prediction accuracy by 4.48% compared with the bimodal predictor which is used in a latest CGRA related research.