A high-performance branch predictor design considering memory capacity limitations

Ha Kyoum Kim, Hanjo Kim, C. M. Eun, Hyun Hak Cho, O. H. Jeong
{"title":"A high-performance branch predictor design considering memory capacity limitations","authors":"Ha Kyoum Kim, Hanjo Kim, C. M. Eun, Hyun Hak Cho, O. H. Jeong","doi":"10.1109/CIRSYSSIM.2017.8023180","DOIUrl":null,"url":null,"abstract":"Pipeline flush due to the flow change of instruction can be a huge degradation factor in modern processors since the branch instructions consist of more than 20 % of all instructions when running a program. However, with a characteristic called branch locality, the result of branch execution is predictable. By utilizing branch locality, there have been a lot of researches to improve the prediction rate of branch predictor however, most of these did not consider the memory capacity so that they cannot be implemented to the embedded systems. Therefore, we propose a new scheme with high prediction rate while maintaining low memory consumption. The new scheme uses an XOR gate to diversify the Pattern History Table (PHT) index. However, the last 6 bits of the index are replaced with PC addresses to enhance the distinction ability of branch instruction addresses. The simulation was executed using SimpleScalar 3.0 simulator, and benchmarks from SPEC CPU2000. Based on the simulation result, this new structure achieved higher prediction rate while maintaining the low memory consumption. Consequently, the new scheme is the most appropriate branch predictor among comparison group presented in this paper.","PeriodicalId":342041,"journal":{"name":"2017 International Conference on Circuits, System and Simulation (ICCSS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Circuits, System and Simulation (ICCSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIRSYSSIM.2017.8023180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Pipeline flush due to the flow change of instruction can be a huge degradation factor in modern processors since the branch instructions consist of more than 20 % of all instructions when running a program. However, with a characteristic called branch locality, the result of branch execution is predictable. By utilizing branch locality, there have been a lot of researches to improve the prediction rate of branch predictor however, most of these did not consider the memory capacity so that they cannot be implemented to the embedded systems. Therefore, we propose a new scheme with high prediction rate while maintaining low memory consumption. The new scheme uses an XOR gate to diversify the Pattern History Table (PHT) index. However, the last 6 bits of the index are replaced with PC addresses to enhance the distinction ability of branch instruction addresses. The simulation was executed using SimpleScalar 3.0 simulator, and benchmarks from SPEC CPU2000. Based on the simulation result, this new structure achieved higher prediction rate while maintaining the low memory consumption. Consequently, the new scheme is the most appropriate branch predictor among comparison group presented in this paper.
考虑内存容量限制的高性能分支预测器设计
在现代处理器中,由于指令流变化引起的管道刷新可能是一个巨大的降级因素,因为在运行程序时,分支指令占所有指令的20%以上。然而,由于有一个称为分支局部性的特性,分支执行的结果是可预测的。利用分支局部性来提高分支预测器的预测率已经有很多研究,但大多数研究都没有考虑到内存容量,无法在嵌入式系统中实现。因此,我们提出了一种在保持低内存消耗的同时具有高预测率的新方案。新方案使用异或门使模式历史表(PHT)索引多样化。但是,索引的后6位被PC地址代替,以增强分支指令地址的区分能力。仿真使用SimpleScalar 3.0模拟器和SPEC CPU2000的基准测试来执行。仿真结果表明,该结构在保持较低内存消耗的同时,实现了较高的预测率。因此,新方案是本文提出的比较组中最合适的分支预测器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信