Avoiding Conditional Branches by Code Replication

ACM SIGPLAN Notices

Volumn 30, Issue 6, 1995, Pages 56-66

  Mueller, Frank ^a   Whalley, David B ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b FLORIDA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976730172     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/223428.207116     Document Type: Article

References (15)

1. [Ban93] U. Banerjee, Loop Transformations for Restructuring Compilers: The Foundations, Kluwer Academic Publishers, Norwell, MA (1993).
2. [BeD88] M. E. Fenitez and J. W. Davidson, “A Portable Global Optimizer and Linker” Proceedings of the SIGPLAN'88 Symposium on Programming Language Design and Implementation, pp. 329–338 (June 1988).
3. [DaH88] J. Davidson and A. Holler, “A Study of a C Function Inliner Software—Practice & Experience 18(8) pp. 775–790 (August 1988).
4. [DaH92] J. W. Davidson and A. M. Holler, “Subprogram Inlining: A Study of its Effects on Program Execution Time” IEEE Transactions on Software Engineering 18(2) pp. 89–102 (February 1992).
5. [DaW91] J. W. Davidson and D. B. Whalley, “A Design Environment for Addressing Architecture and Compiler Interactions”, Microprocessors and Microsystems 15(9) pp. 459–472 (November 1991).
6. [GoR90] M. C. Golumbic and V. Rainish, “Instruction Scheduling beyond Basic Blocks,” IBM Journal of Research and Development 34(1) pp. 93–97 (January 1990).
7. [GrK92] T. Granlund and R. Kenner, “Eliminating Branches using a Superoptimizer and the GNU C Compiler,” Proceedings of the SIGPLAN'92 Conference on Programming Language Design and Implementation, pp. 341–352 (June 1992).
8. [HeP90] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, CA (1990).
9. [Jai91] S. Jain, “Circular Scheduling: A New Technique to Perform Software Pipelining,” Proceedings of the SIGPLAN ’91 Symposium on Programming Language Design and Implementation, pp. 219–228 (June 1991).
10. [Kra94] A. Krall, “Improving Semi-static Branch Prediction by Code Replication,” Proceedings of the SIGPLAN'94 Symposium on Programming Language Design and Implementation, pp. 97–106 (June 1994).
11. [LRS76] P. M. Lewis, D. J. Rosenkrantz, and R. E. Stearns, Compiler Design Theory; Addison-Wesley, Reading, MA (1976).
12. [MoR79] E. Morel and C. Renvoise, “Global Optimizations by Suppression of Partial Redundancies,” Communications of the ACM 22(2) pp. 96–103 (February 1979).
13. [MuW92] F. Mueller and D. B. Whalley, “Avoiding Unconditional Jumps by Code Replication,” Proceedings of the SIGPLAN'92 Conference on Programming Language Design and Implementation, PP- 322–330 (June 1992).
14. [Smi82] A. J. Smith, “Cache Memories,” Computing Surveys 14(3) pp. 473–530 (September 1982).
15. [YoS94] C. Young and M. D. Smith, “Improving the Accuracy of Static Branch Prediction Using Branch Correlation,” Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 232–241 (November 1994).