Practical adaption of the global optimization algorithm of Morel and Renvoise
- 1 April 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 13 (2) , 291-294
- https://doi.org/10.1145/103135.214520
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 algorithmKeywords
This publication has 4 references indexed in Scilit:
- Some comments on “A solution to a problem with Morel and Renvoise's 'Global optimization by suppression of partial redundancies'”ACM Transactions on Programming Languages and Systems, 1989
- A fast algorithm for code movement optimisationACM SIGPLAN Notices, 1988
- A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”ACM Transactions on Programming Languages and Systems, 1988
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979