Partial Redundancy Elimination (PRE) is a standard program optimization which removes redundant computations via Code Motion.
It subsumes and generalizes the optimizations of Global Common Subexpression Elimination (GCSE) and Loop Invariant Code Motion
(LICM). Recent work has generalized PRE to become Speculative PRE (SPRE), which uses estimates of execution frequencies to
find the optimal places in a program to perform computations. However, the analysis performed by the compiler is computationally
intensive and hence impractical for just-in-time (JIT) compilers.
This paper introduces a novel approach which abandons a guarantee of optimality in favour of simplicity and speed of analysis.
This new approach, called Isothermal SPRE, achieves results which are close to optimal in practice, yet its analysis time
is at least as good as current compiler techniques for code motion. It is a technique suitable for use in JIT compilers.