寄存器更新单元大小对多路径执行的影响

Chao-Chin Wu, Kuan-Chou Lai, En-Hao Liu, Jin-Yuan Chen
{"title":"寄存器更新单元大小对多路径执行的影响","authors":"Chao-Chin Wu, Kuan-Chou Lai, En-Hao Liu, Jin-Yuan Chen","doi":"10.1109/PACRIM.2007.4313190","DOIUrl":null,"url":null,"abstract":"Branch prediction is a key mechanism to boost the system performance of a superscalar processor. Though the prediction accuracy rate becomes higher and higher, the mispredicitons still lead to significant performance losses in a wide-issue deep-pipelined superscalar. To address the problem, the technique of multipath execution has been proposed previously, which is capable of executing both paths whenever a lower-confidence conditional branch is encountered. However, because the instructions from different paths share a single register update unit (RUU), they are interleaved in the RUU. In consequence, when a conditional branch is resolved and the instructions on the wrong paths are squashed, all the entries in the resulting holes cannot be reused until they are reclaimed at the commit stage. Since the RUU size is crucial to the performance, it is interesting to know how much can we speedup the performance if the squashed RUU entries can be reused as soon as possible. We have proposed a simple mechanism with very limited hardware resources to achieve this goal. Finally the preliminary simulation results are presented.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Impact of the Register Update Unit Size on Multipath Execution\",\"authors\":\"Chao-Chin Wu, Kuan-Chou Lai, En-Hao Liu, Jin-Yuan Chen\",\"doi\":\"10.1109/PACRIM.2007.4313190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Branch prediction is a key mechanism to boost the system performance of a superscalar processor. Though the prediction accuracy rate becomes higher and higher, the mispredicitons still lead to significant performance losses in a wide-issue deep-pipelined superscalar. To address the problem, the technique of multipath execution has been proposed previously, which is capable of executing both paths whenever a lower-confidence conditional branch is encountered. However, because the instructions from different paths share a single register update unit (RUU), they are interleaved in the RUU. In consequence, when a conditional branch is resolved and the instructions on the wrong paths are squashed, all the entries in the resulting holes cannot be reused until they are reclaimed at the commit stage. Since the RUU size is crucial to the performance, it is interesting to know how much can we speedup the performance if the squashed RUU entries can be reused as soon as possible. We have proposed a simple mechanism with very limited hardware resources to achieve this goal. Finally the preliminary simulation results are presented.\",\"PeriodicalId\":395921,\"journal\":{\"name\":\"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2007.4313190\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2007.4313190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

分支预测是提高超标量处理器系统性能的关键机制。尽管预测准确率越来越高,但在大问题深管道超标量中,错误预测仍然会导致显著的性能损失。为了解决这个问题,之前已经提出了多路径执行技术,它能够在遇到低置信度条件分支时执行两条路径。然而,由于来自不同路径的指令共享一个寄存器更新单元(RUU),它们在RUU中是交错的。因此,当解析条件分支并压缩错误路径上的指令时,所产生的洞中的所有条目都不能被重用,直到在提交阶段回收它们。由于RUU的大小对性能至关重要,所以如果能够尽快重用被压缩的RUU条目,我们可以在多大程度上提高性能,这一点很有趣。我们提出了一个简单的机制,用非常有限的硬件资源来实现这一目标。最后给出了初步的仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Impact of the Register Update Unit Size on Multipath Execution
Branch prediction is a key mechanism to boost the system performance of a superscalar processor. Though the prediction accuracy rate becomes higher and higher, the mispredicitons still lead to significant performance losses in a wide-issue deep-pipelined superscalar. To address the problem, the technique of multipath execution has been proposed previously, which is capable of executing both paths whenever a lower-confidence conditional branch is encountered. However, because the instructions from different paths share a single register update unit (RUU), they are interleaved in the RUU. In consequence, when a conditional branch is resolved and the instructions on the wrong paths are squashed, all the entries in the resulting holes cannot be reused until they are reclaimed at the commit stage. Since the RUU size is crucial to the performance, it is interesting to know how much can we speedup the performance if the squashed RUU entries can be reused as soon as possible. We have proposed a simple mechanism with very limited hardware resources to achieve this goal. Finally the preliminary simulation results are presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信