The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1998 vol.9)
pp: 609-625
ABSTRACT
<p><b>Abstract</b>—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 present an Interprocedural Partial Redundancy Elimination (IPRE) scheme based upon a new, concise, full program representation. Our method is applicable to arbitrary recursive programs. We use interprocedural partial redundancy elimination for placement of communication and communication preprocessing statements while compiling for distributed memory parallel machines. We have implemented our scheme as an extension to the Fortran D compilation system. We present experimental results from two codes compiled using our system to demonstrate the useful of IPRE in distributed memory compilation.</p>
INDEX TERMS
Distributed memory compilation, Partial Redundancy Elimination, interprocedural analysis, communication optimizations, irregular applications.
CITATION
Gagan Agrawal, "Interprocedural Partial Redundancy Elimination With Application to Distributed Memory Compilation", IEEE Transactions on Parallel & Distributed Systems, vol.9, no. 7, pp. 609-625, July 1998, doi:10.1109/71.707537
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool