1996
DOI: 10.1007/bf03356745
|View full text |Cite
|
Sign up to set email alerts
|

Branch Classification: A New Mechanism for Improving Branch Predictor Performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
49
0

Year Published

2000
2000
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(50 citation statements)
references
References 10 publications
0
49
0
Order By: Relevance
“…Branches vary widely in their dynamic behavior, and predictors that work well on one type of branches may not work as well on others. A set of hard-to-predict branches that comprise a fundamental limit to traditional branch predictors can always be identified [17]. We assume that there are two classes: easy-to-predict and hard-to-predict branches, and the expected branch prediction accuracy is higher for the first, and lower for the second.…”
Section: Model Definitionmentioning
confidence: 99%
“…Branches vary widely in their dynamic behavior, and predictors that work well on one type of branches may not work as well on others. A set of hard-to-predict branches that comprise a fundamental limit to traditional branch predictors can always be identified [17]. We assume that there are two classes: easy-to-predict and hard-to-predict branches, and the expected branch prediction accuracy is higher for the first, and lower for the second.…”
Section: Model Definitionmentioning
confidence: 99%
“…Using this information, the selector associates a currently predicted branch to either global or per-address predictor which is most likely to be more accurate. Using similar amount of hardware resources, this hybrid approach is proved to be more accurate than the stand-alone predictors [4][5][6].…”
Section: Characterization Of Conditionalmentioning
confidence: 99%
“…Many sophisticated conditional branch prediction schemes have been proposed, including twolevel adaptive predictors [2,3], gshare predictor [4], and hybrid predictors [4,5]. These predictors and their variants exploit past history of the predicted branch, history of recent branches, and other branch correlations to accurately predict conditional branches [6,7].…”
Section: Introductionmentioning
confidence: 99%
“…In microrocessors, the accuracy of the branch prediction is surprisingly high -more than 95 % are reported in (Chang et al, 1994) for single SPEC benchmark programs. However, rerolling execution in case of a wrongly predicted path is costly in terms of processor cycles, especially in deeply pipelined microprocessors.…”
Section: Micro Dataflowmentioning
confidence: 99%