INTERPROCEDURAL PARTIAL REDUNDANCY ELIMINATION AND ITS APPLICATION TODISTRIBUTED-MEMORY COMPILATION

Partial Redundancy Elimination (PRE) is a general scheme for suppressi ng partial redundancies which encompasses traditional optimizations li ke loop invariant code motion and redundant code elimination, In this paper we address the problem of performing this optimization interproc edurally. We use interprocedural partial redundancy elimination for pl acement of communication and communication preprocessing statements wh ile compiling for distributed memory parallel machines.