ACM Home Page
Please provide us with feedback. Feedback
An analysis of correlation and predictability: what makes two-level branch predictors work
Full text PdfPdf (1.23 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 25th annual international symposium on Computer architecture table of contents
Barcelona, Spain
Pages: 52 - 61  
Year of Publication: 1998
ISBN:0-8186-8491-7
Also published in ...
Authors
Marius Evers  Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI
Sanjay J. Patel  Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI
Robert S. Chappell  Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI
Yale N. Patt  Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 31,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/279358.279368
What is a DOI?

ABSTRACT

Pipeline flushes due to branch mispredictions is one of the most serious problems facing the designer of a deeply pipelined, superscalar processor. Many branch predictors have been proposed to help alleviate this problem, including two-level adaptive branch predictors and hybrid branch predictors.Numerous studies have shown which predictors and configurations best predict the branches in a given set of benchmarks. Some studies have also investigated effects, such as pattern history table interference, that can be detrimental to the performance of these predictors. However, little research has been done on which characteristics of branch behavior make predictors perform well.In this paper, we investigate and quantify reasons why branches are predictable. We show that some of this predictability is not captured by the two-level adaptive branch predictors. An understanding of the predictability of branches may lead to insights ultimately resulting in better or less complex predictors. We also investigate and quantify what fraction of the branches in each benchmark is predictable using each of the methods described in this paper.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
S. McFarling, "Combining branch predictors," Technical Report TN-36, Digital Western Research Laboratory, June 1993.
 
3
4
 
5
6
7
 
8
 
9
10
11
12

CITED BY  26

Collaborative Colleagues:
Marius Evers: colleagues
Sanjay J. Patel: colleagues
Robert S. Chappell: colleagues
Yale N. Patt: colleagues