© 1999 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Source Level Static Branch Prediction
A1 Department of Computer Science, School of Computing, National University of Singapore, Lower Kent Ridge Road, Singapore 119260
The ability to predict the directions of branches, especially conditional branches, is an important problem in modern computer architecture and advanced compilers. Many static and dynamic techniques have been proposed. Today, all state-of-the-art microprocessors have some form of hardware support for dynamic branch prediction. Static techniques, on the other hand, have not been widely studied because of the belief that they give poorer results. However, good static branch predictions are invaluable information for (static) compiler optimization or performance estimation. In this paper, we propose performing static branch prediction at the source code level. The assumption is that the source code contains information unavailable at the assembly or machine code level that may be used for branch prediction. Empirical studies on 14 integer Spec benchmarks indicate that the simple heuristics proposed can be effective in practice.
Received 24 July, 1998. Revised 24 March, 1999.