DMCA
Branch Prediction For Free (1993)
Cached
Download Links
- [ftp.cs.wisc.edu]
- [www.ece.cmu.edu]
- [research.microsoft.com]
- [research.microsoft.com]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Citations: | 178 - 8 self |
BibTeX
@INPROCEEDINGS{Ball93branchprediction,
author = {Thomas Ball and James R. Larus},
title = {Branch Prediction For Free},
booktitle = {},
year = {1993},
pages = {300--313},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Many compilers rely on branch prediction to improve program performance by identifying frequently executed regions and by aiding in scheduling instructions. Profile-based predictors require a time-consuming and inconvenient compile-profile-compile cycle in order to make predictions. We present a program-based branch predictor that performs well for a large and diverse set of programs written in C and Fortran. In addition to using natural loop analysis to predict branches that control the iteration of loops, we focus on heuristics for predicting non-loop branches, which dominate the dynamic branch count of many programs. The heuristics are simple and require little program analysis, yet they are effective in terms of coverage and miss rate. Although program-based prediction does not equal the accuracy of profile-based prediction, we believe it reaches a sufficiently high level to be useful. Additional type and semantic information available to a compiler would enhance our heuristics. #...
Keyphrases
branch prediction many compiler high level inconvenient compile-profile-compile cycle natural loop analysis miss rate program-based branch predictor diverse set profile-based prediction require little program analysis program performance non-loop branch additional type many program dynamic branch count semantic information profile-based predictor program-based prediction
