Practical Adaptation of the Global Optimization Algorithm of Morel and Renvoise

Abstract

We present some modifications to Morel and Renvoise's algorithm for global optimization by suppression of partial redundancies.The modifications are motivated by the desire to ( 1) eliminate redundant code motion, and (2) extend the scope of optimization to the movement of assignments.The complexity of the modified algorithm is compared with that of the original algorithm.