Compiler techniques to improve dynamic branch prediction for indirect jump and call instructions

Transactions on Architecture and Code Optimization

Volumn 8, Issue 4, 2012, Pages

  McCandless, Jason ^a   Gregg, David ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Branch prediction; Interpreters; Object oriented

Indexed keywords

ASSEMBLY LANGUAGE; BRANCH PREDICTION; CODE GENERATION; COMPILER TECHNIQUES; INDIRECT BRANCH; MODERN PROCESSORS; OBJECT ORIENTED; OBJECT-ORIENTED LANGUAGES; PROGRAM PERFORMANCE; SIGNIFICANT IMPACTS; VIRTUAL FUNCTIONS;

HARDWARE; PROGRAM INTERPRETERS; SOFTWARE ENGINEERING;

PROGRAM COMPILERS;

EID: 84857839412     PISSN: 15443566     EISSN: 15443973     Source Type: Journal    
DOI: 10.1145/2086696.2086703     Document Type: Article

References (32)

1. Advanced Micro Devices 2008. Software Optimization Guide for AMD Family 10h Processors. Advanced Micro Devices.
2. BROWNE, S., DONGARRA, J., GARNER, N., LONDON, K., AND MUCCI, P. 2000. A scalable cross-platform infrastructure for application performance tuning using hardware counters. In Proceedings of the ACM/IEEE Conference on Supercomputing (Supercomputing '00). IEEE Computer Society, Los Alamitos, CA.
3. CALDER, B. AND GRUNWALD, D. 1994. Reducing branch costs via branch alignment. In Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI). ACM, New York, 242-251.
4. CHANG, P.-Y., HAO, E., AND PATT, Y. N. 1997. Target prediction for indirect jumps. In Proceedings of the 24th Annual International Symposium on Computer Architecture (ISCA '97). ACM, New York, 274-283.
5. CHEN, C.-M. AND KING, C.-T. 1999. Walk-time address adjustment for improving the accuracy of dynamic branch prediction. Comput. IEEE Trans. 48, 5, 457-469.
6. CLBG. 2011. The computer language benchmarks game. http://shootout. alioth.debian.org/.
7. DEITRICH, B., CHENG, B.-C., AND HWU, W.-M. 1998. Improving static branch prediction in a compiler. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT '98). IEEE Computer Society, Los Alamitos, CA, 214.
8. DRIESEN, K. AND HÖLZLE, U. 1998. Accurate indirect branch prediction. In Proceedings of the 25th Annual International Symposium on Computer Architecture (ISCA '98). IEEE Computer Society, Los Alamitos, CA, 167-178.
9. GOCHMAN, S., RONEN, R., I. ANATI, A. B., KURTS, T., NAVEH, A., SAEED, A., SPERBER, Z., AND VALENTINE, R. 2003. The Intel Pentium M processor: Microarchitecture and performance. Intel Tech. J. 7, 2.
10. HUNDT, R., RAMAN, E., THURESSON, M., AND VACHHARAJANI, N. 2011. MAO - an extensible micro-architectural optimizer. In Proceedings of the 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO). 1-10.
11. JIMÉNEZ, D. A. 2005. Code placement for improving dynamic branch prediction accuracy. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '05). ACM, New York, 107-116.
12. KALAMATIANOS, J. AND KAELI, D. 1999. Indirect branch prediction using data compression techniques. J. Instruct. Level Paral. 1, 6.
13. KIM, H., JOAO, J. A., MUTLU, O., LEE, C. J., PATT, Y. N., AND COHN, R. 2009. Virtual program counter (vpc) prediction: Very low cost indirect branch prediction using conditional branch prediction hardware. IEEE Trans. Comput. 58, 1153-1170.
14. KNIGHTS, D., MYTKOWICZ, T., SWEENEY, P. F., MOZER, M. C., AND DIWAN, A. 2009. Blind optimization for exploiting hardware features. In Proceedings of the 18th International Conference on Compiler Construction (Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS) (CC '09). Springer-Verlag, Berlin, 251-265.
15. KNUTH, D. E. 1998. The Art of Computer Programming, volume 3: (2nd ed.) Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA.
16. KNUTH, D. E. 2005. The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions. Addison-Wesley Professional.
17. KRALL, A. 1994. Improving semi-static branch prediction by code replication. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '94). ACM, New York, 97-106.
18. LI, T., BHARGAVA, R., AND JOHN, L. K. 2005. Adapting branch-target buffer to improve the target predictability of java code. ACM Trans. Archit. Code Optim. 2, 109-130.
19. LOUGHER, R. 2011. JamVM virtual machine. http://jamvm.sourceforge.net.
20. LUK, C.-K., COHN, R., MUTH, R., PATIL, H., KLAUSER, A., LOWNEY, G., WALLACE, S., REDDI, V. J., AND HAZELWOOD, K. 2005. PIN: Building customized program analysis tools with dynamic instrumentation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '05). ACM, New York, 190-200.
21. MAHLKE, S. AND NATARAJAN, B. 1996. Compiler synthesized dynamic branch prediction. In Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture (MICRO 29). IEEE Computer Society, Los Alamitos, CA, 153-164.
22. MATHEW, J. A., CODDINGTON, P. D., AND HAWICK, K. A. 1999. Analysis and development of Java grande benchmarks. In Proceedings of the ACM Conference on Java Grande (JAVA '99). ACM, New York, 72-80.
23. MCCANDLESS, J. AND GREGG, D. 2011. Optimizing interpreters by tuning opcode orderings on virtual machines for modern architectures. In Proceedings of the 9th International Conference on the Principles and Practice of Programming in Java (PPPJ '11). ACM, New York.
24. MILENKOVIC, M., MILENKOVIC, A., AND KULICK, J. 2002. Demystifying Intel branch predictors. In Proceedings of the Workshop on Duplicating, Deconstructing and Debunking, John Wiley & Sons, 52-61.
25. MYTKOWICZ, T., DIWAN, A., HAUSWIRTH, M., AND SWEENEY, P. F. 2009. Producing wrong data without doing anything obviously wrong! In Proceeding of the 14th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '09). ACM, New York, 265-276.
26. NATHANSON, M. B. 1996. Additive number theory: Inverse problems and the geometry of sumsets. In Graduate Texts in Mathematics. Springer.
27. SAYLE, R. 2008. A superoptimizer analysis of multiway branch code generation. In GCC Developers' Summit, 103.
28. STANDARD PERFORMANCE EVALUATION CORPORATION. 2011. SPEC CPU2006. http://www.spec.org/cpu2006/.
29. UH, G.-R. AND WHALLEY, D. B. 1999. Effectively exploiting indirect jumps. Softw. Pract. Exper. 29, 1061-1101.
30. UZELAC, V. AND MILENKOVIC, A. 2009. Experiment flows andmicrobenchmarks for reverse engineering of branch predictor structures. In Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS '09). 207-217.
31. YANG, M., UH, G.-R., AND WHALLEY, D. B. 2002. Efficient and effective branch reordering using profile data. ACM Trans. Program. Lang. Syst. 24, 667-697. (Pubitemid 135690780)
32. YOUNG, C., GLOY, N., AND SMITH, M. D. 1995. A comparative analysis of schemes for correlated branch prediction. In Proceedings of the 22nd Annual International Symposium on Computer Architecture (ISCA '95). ACM, New York, 276-286.