Quote: bit-vector algorithm for lazy code motion subsumes loop invariant code motion, common subexpression elimination, and redundancy elimination; computation as early as necessary and as late as possible

Quotation Skeleton

In 1979, Morel and Renvoise came up with … [for code motion], the suppression of partial redundancies [Comm. ACM 22.2:96-103]. Their technique uniformly subsumed … the transformation was solely based on data-flow analysis … On the other hand , their genuine proposal … [p. 471] We have presented a bit-vector algorithm for … standard uni-directional analyses. Important feature of this algorithm … guarantees the lifetime optimality while preserving computational optimality. …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: code optimization by flow analysis (45 items)
Group: expression evaluation   (5 topics, 96 quotes)
Topic: code optimization by code rewrite (30 items)