R. Santos, T. Santos, M. Pilla, P. Navaux, S. Bampi, M. Nemirovsky
{"title":"Complex branch profiling for dynamic conditional execution","authors":"R. Santos, T. Santos, M. Pilla, P. Navaux, S. Bampi, M. Nemirovsky","doi":"10.1109/CAHPC.2003.1250318","DOIUrl":null,"url":null,"abstract":"Branch predictors are widely used as an alternative to deal with conditional branches. Despite the high accuracy rates, misprediction penalties are still large in any superscalar pipeline. DCE, or dynamic conditional execution, is an alternative to reduce the number of predicted branches by executing both paths of certain branches, reducing the number of predictions and, therefore, the occurrence of mispredictions. The goal of this work is to analyze the complexity of branch structures and determine the number of branches that can be predicated in DCE and the distribution of mispredictions according to the proposed classification. The complex branch classification proposed extends the classification presented by Klauser [A. Klauser, et al., (1998)]. As result, we show that an average of 35% of all branches can be predicated in DCE and around 32% of all mispredictions fall into these branches.","PeriodicalId":433002,"journal":{"name":"Proceedings. 15th Symposium on Computer Architecture and High Performance Computing","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 15th Symposium on Computer Architecture and High Performance Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAHPC.2003.1250318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Branch predictors are widely used as an alternative to deal with conditional branches. Despite the high accuracy rates, misprediction penalties are still large in any superscalar pipeline. DCE, or dynamic conditional execution, is an alternative to reduce the number of predicted branches by executing both paths of certain branches, reducing the number of predictions and, therefore, the occurrence of mispredictions. The goal of this work is to analyze the complexity of branch structures and determine the number of branches that can be predicated in DCE and the distribution of mispredictions according to the proposed classification. The complex branch classification proposed extends the classification presented by Klauser [A. Klauser, et al., (1998)]. As result, we show that an average of 35% of all branches can be predicated in DCE and around 32% of all mispredictions fall into these branches.
分支预测器被广泛用作处理条件分支的替代方法。尽管准确率很高,但在任何超标量管道中,错误预测的惩罚仍然很大。DCE,即动态条件执行,是通过执行某些分支的两条路径来减少预测分支数量的一种替代方法,从而减少预测的数量,从而减少错误预测的发生。这项工作的目标是分析分支结构的复杂性,并根据提出的分类确定可以在DCE中预测的分支数量和错误预测的分布。提出的复杂分支分类扩展了Klauser [A.]提出的分类。Klauser, et al.,(1998)。结果,我们表明,平均35%的分支可以在DCE中预测,大约32%的错误预测属于这些分支。