A compiler framework for speculative optimizations
Authors:
Open Access
- 1 September 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 1 (3) , 247-271
Abstract
Speculative execution, such as control speculation or data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristic rules, existing compiler frameworks can adequately incorporate and exploit control speculation. However, very little has been done so far to allow existing compiler frameworks to incorporate and exploit data speculation effectively in various program transformations beyond instruction scheduling. This paper proposes a speculative static single assignment form to incorporate information from alias profiling and/or heuristic rules for data speculation, thus allowing existing frameworks to be extended to support both control and data speculation. Such a general framework is very useful for EPIC architectures that provide run-time checking (such as advanced load address table ) on data speculation to guarantee the correctness of program execution. We use SSAPRE as one example to illustrate how to incorporate data speculation in partial redundancy elimination, register promotion, and strength reduction. Our extended framework allows both control and data speculations to be performed on top of SSAPRE and, thus, enables more aggressive speculative optimizations. The proposed framework has been implemented on Intel's Open Research Compiler. We present experimental data on some SPEC2000 benchmark programs to demonstrate the usefulness of this framework.Keywords
This publication has 28 references indexed in Scilit:
- An Empirical Study on the Granularity of Pointer Analysis in C ProgramsLecture Notes in Computer Science, 2005
- Data Dependence Profiling for Speculative Optimizations2004
- Partial redundancy elimination in SSA formACM Transactions on Programming Languages and Systems, 1999
- Probabilistic memory disambiguation and its application to data speculationACM SIGARCH Computer Architecture News, 1999
- Strength reduction via SSAPRE1998
- Effective representation of aliases and indirect memory operations in SSA form1996
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Practical adaption of the global optimization algorithm of Morel and RenvoiseACM Transactions on Programming Languages and Systems, 1991
- Run-time disambiguation: coping with statically unpredictable dependenciesIEEE Transactions on Computers, 1989
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979