Partial Redundancy Elimination with Predication Techniques

Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication optimizations, and load-reuse optimizations, employ PRE as an underlying technique for improving the efficiency of a program.

[1]  Bernhard Steffen,et al.  Optimal code motion: theory and practice , 1994, TOPL.

[2]  G. Ramalingam.  Data flow frequency analysis , 1996, PLDI '96.

[3]  Bernhard Steffen,et al.  Property-Oriented Expansion , 1996, SAS.

[4]  R. N. Horspool,et al.  Partial redundancy elimination driven by a cost-benefit analysis , 1997, Proceedings of the Eighth Israeli Conference on Computer Systems and Software Engineering.

[5]  Rajiv Gupta,et al.  Path profile guided partial redundancy elimination using speculation , 1998, Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225).

[6]  Rajiv Gupta,et al.  Load-reuse analysis: design and evaluation , 1999, PLDI '99.

[7]  Mahmut T. Kandemir,et al.  A global communication optimization technique based on data-flow analysis and linear algebra , 1999, TOPL.

[8]  Probabilistic data flow system with two-edge profiling , 2000, DYNAMO '00.

[9]  Bernhard Scholz,et al.  Probabilistic data flow system with two-edge profiling , 2000 .

[10]  Bernhard Scholz,et al.  A Novel Probabilistic Data Flow Framework , 2001, CC.

[11]  Jens Knoop,et al.  Distribution Assignment Placement: Effective Optimization of Redistribution Costs , 2002, IEEE Trans. Parallel Distributed Syst..

[12]  Bernhard Scholz,et al.  Dataflow frequency analysis based on whole program paths , 2002, Proceedings.International Conference on Parallel Architectures and Compilation Techniques.

[13]  Rajiv Gupta,et al.  Complete removal of redundant expressions , 1998, PLDI 1998.