Partial Redundancy Elimination (PRE) is a general scheme for suppressing
partial redundancies which encompasses traditional optimizations like loop
invariant code motion and redundant code elimination. In this paper we
address the problem of performing this optimization interprocedurally. We
use interprocedural partial redundancy elimination for placement of
communication and communication preprocessing statements while compiling
for distributed memory parallel machines.
(Also cross-referenced as UMIACS-TR-95-42
