The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Branch prediction for free
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,370
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,082
Trace Scheduling: A Technique for Global Microcode Compaction
Fisher (1981) · IEEE Transactions on Computers · doi:10.1109/tc.1981.1675827 · Cited by 1,267
A study of branch prediction strategies
Smith, J. E. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.285980 · Cited by 797
Branch Prediction Strategies and Branch Target Buffer Design
Lee, & Smith (1984) · Computer · doi:10.1109/mc.1984.1658927 · Cited by 614
Alpha architecture reference manual
(1992) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(92)90080-z · Cited by 304
Optimally profiling and tracing programs
Ball, T., & Larus, J. R. (1992) · Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92 · doi:10.1145/143165.143180 · Cited by 165
Self-citationOptimally Profiling and Tracing
Ball, T., & Larus, J. R. (1994) · Cited by 14
Self-citation
Cited by
Towards automatically generating summary comments for Java methods
Sridhara, G., Hill, E., Muppaneni, D., Pollock, L., & Vijay-Shanker, K. (2010) · Proceedings of the IEEE/ACM international conference on Automated software engineering · doi:10.1145/1858996.1859006 · Cited by 514
Optimally profiling and tracing programs
Ball, T., & Larus, J. R. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/183432.183527 · Cited by 362
Self-citationAdaptive optimization in the Jalapeño JVM
Arnold, M., Fink, S., Grove, D., Hind, M., & Sweeney, P. F. (2000) · Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/353171.353175 · Cited by 257
Metadata
- Authors
- Ball, T., & Larus, J. R.
- Venue
- Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 1993-06
- Pages
- 300-313
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W1969012464
- Cited by
- 289
- References
- 8
- FWCI
- 11.54
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Branch prediction for free. https://app.cochat.ai/papers/10.1145/155090.155119
- The paper
- Ball, T., & Larus, J. R. (1993). Branch prediction for free. Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation. https://doi.org/10.1145/155090.155119
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.