Branch Prediction For Free (1993) [145 citations — 8 self]
ftp://ftp.cs.wisc.edu/tech-reports/reports/1993/tr
http://research.microsoft.com/~tball/papers/pldi93
CiteULike | DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Thomas Ball and Thomas Ball and James R. Larus and James R. Larus},
title = {Branch Prediction For Free},
booktitle = {},
year = {1993},
pages = {300--313}
}
Years of Citing Articles
Bookmarks
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. #...
