Efficient and effective branch reordering using profile data

ACM Transactions on Programming Languages and Systems

Volumn 24, Issue 6, 2002, Pages 667-697

  Yang, Minghui ^a   Uh, Gang Ryung ^b   Whalley, David B ^c  

^a Boise State University ^*  (United States)

^b Boise State University   (United States)

^c Florida State University   (United States)

Author keywords

Algorithms; Branch reordering; Compilers; optimization; Conditional branches; Languages; Profiling

Indexed keywords

EID: 0038893905     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/586088.586091     Document Type: Article

References (19)

1. ALLEN, F., COCKE, J. AND RUSTIN, R. 1971. A Catalogue of Optimizing Transformations. Prentice-Hall, Englewood Cliffs, NJ.
2. BENITEZ, M. E. AND DAVIDSON, J. W. 1988. A portable global optimizer and linker. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation. SIGPLAN Notices 23, 7 (July), 329-338.
3. BODIK, R., GUPTA, R., AND SOFFA, M. 1997. Interprocedural conditional branch elimination. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. SIGPLAN Notices, 146-158.
4. CALDER, B. AND GRUNWALD, D. 1994. Reducing branch costs via branch alignment. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, 242-251.
5. CLAPP, R. M., DUCHESNEAU, L., VOLZ, A., MUDGE, T. N., AND SCHULTZE, T. 1986. Toward real-time performance benchmarks for ada. Commun. ACM. 760-778.
6. DAVIDSON, J. W. AND WHALLEY, D. B. 1992. A design environment for addressing architecture and compiler interactions. Information and Software Technology 34, 11 (11), 707-720.
7. DONGARRA, J. AND HINDS, A. 1979. Unrolling loops in fortran. Software Practice & Experience 9, 219-226.
8. FISHER, J. A. AND FREUDENBERGER, S. M. 1992. Predicting conditional branch directions from previous runs of a program. In Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, 85-97.
9. HENNESSY, J. AND PATTERSON, D. 1996. Computer Architecture: A Quantitative Approach, Second Edition. Morgan Kaufmann, San Francisco, CA.
10. JINTURKAR, S. AND DAVIDSON, J. W. 1996. Aggressive loop unrolling in a retargetable, optimizing compiler. In Proceedings of Compiler Construction Conference, 59-73.
11. JOHNSON, S. C. 1979. A tour through the portable C compiler. Unix Programmer's Manual, 7th Edition, Section 33.
12. MUELLER, F. AND WHALLEY, D. B. 1995. Avoiding conditional branches by code replication. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation. SIGPLAN Notices, 56-66.
13. SCHLANSKER, M., MAHLKE, S., AND JOHNSON, R. 1999. Control cpr a branch height reduction optimization for epic architectures. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation. SIGPLANNotices, 155-168.
14. SPULER, D. A. 1994. Compiler code generation for multiway branch statements as a static search problem. Tech. Rep. 94/3. James Cook University, Townsville, Australia.
15. UH, G. R. 1997. Effectively exploiting indirect jumps. Ph.D. thesis, Florida State University, Talahassee, Florida.
16. UH, G. R. AND WHALLEY, D. B. 1997. Coalescing conditional branches into efficient indirect jumps. In Proceedings of the International Static Analysis Symposium, 315-329.
17. YANG, M. 1998. Improving performance by branch reordering. M.S. thesis, Florida State University, Talahassee, Florida.
18. YOUNG, C., JOHNSON, D. S., KARGER, D. R., AND SMITH, M. D. 1997. Near-optimal intraprocedural branch alignment. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation. SIGPLAN Notices, 183-193.
19. YOUNG, C. AND SMITH, M. D. 1994. Improving the accuracy of static branch prediction using branch correlation. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, 232-241.