The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (1998)
Paris, France
Oct. 12, 1998 to Oct. 18, 1998
ISSN: 1089-795X
ISBN: 0-8186-8591-3
pp: 214
Ben-Chung Cheng , University of Illinois
Brian Deitrich , Motorola
Wen-mei Hwu , University of Illinois
ABSTRACT
An ILP (Instruction-Level Parallelism) compiler uses aggressive optimizations to reduce a program's running time. These optimizations have been shown to be effective when profile information is available. Unfortunately, users are not always willing or able to profile their programs. A method of overcoming this issue is for an ILP compiler to statically infer the information normally obtained from profiling. This paper investigates one aspect of this inference: the static prediction of conditional-branch direction. The goals of this work are to utilize the source-level information available in a compiler when performing static branch prediction, to identify static-branch-prediction cases in which there is a high confidence that a branch will go in one direction at run time, to gain an intuitive understanding into the reasons why the static-branch-prediction heuristics are effective, and ultimately to improve the accuracy of the static branch prediction. The effectiveness of the static-branch-prediction heuristics developed in this paper is demonstrated on a set of programs from SPEC CINT92, SPEC CINT95, and the IMPACT compiler.
INDEX TERMS
static branch prediction, profile-based compilation
CITATION
Ben-Chung Cheng, Brian Deitrich, Wen-mei Hwu, "Improving Static Branch Prediction in a Compiler", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 214, 1998, doi:10.1109/PACT.1998.727253
87 ms
(Ver 3.3 (11022016))