ACM Home Page
Please provide us with feedback. Feedback
The effects of predicated execution on branch prediction
Full text PdfPdf (1.20 MB)
Source International Symposium on Microarchitecture archive
Proceedings of the 27th annual international symposium on Microarchitecture table of contents
San Jose, California, United States
Pages: 196 - 206  
Year of Publication: 1994
ISBN:0-89791-707-3
Author
Gary Scott Tyson  Department of Computer Science, University of California, Davis, Davis, CA
Sponsors
IEEE-CS\TCMM : TC on Microprocessors & Microcomputers
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 26,   Citation Count: 15
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/192724.192753
What is a DOI?

ABSTRACT

High performance architectures have always had to deal with the performance limiting impact of branch operations. Microprocessor designs are going to have to deal with this problem as well, as they move towards deeper pipelines and support for multiple instruction issue. Branch prediction schemes are often used to alleviate the negative impact of branch operations by allowing the speculative execution of instructions after an unresolved branch. Another technique is to eliminate branch instructions altogether. Predication can remove forward branch instructions by translating the instructions following the branch into predicate form.This paper analyzes a variety of existing predication models for eliminating branch operations, and the effect that this elimination has on the branch prediction schemes in existing processors, including single issue architectures with simple prediction mechanisms, to the newer multi-issue designs with correspondingly more sophisticated branch predictors. The effect on branch prediction accuracy, branch penalty and basic block size is studied.


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.

 
AlAv93
 
AADM93
CMCW91
DeHB89
FiFr92
 
HePa90
 
LeS84
I.K.L. Lee and A. J. Smith, "Branch Prediction Strategies and Branch Target Buffer Design", Computer, vol. 17, no. 1 (January 1984), pp. 6-22.
 
McLe93
PnSo94
Russ78
 
Site92
 
Smit81
SrWa94
YeP91
YeP93
 
94
"PowerPC 601 RISC Microprocessor Users's Manual Addendum for 604", Motorola / IBM Microelectronics(1993, 1994).

CITED BY  15