Sciweavers

Share
PLDI
1995
ACM

Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation

9 years 6 months ago
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
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.
Gagan Agrawal, Joel H. Saltz, Raja Das
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where PLDI
Authors Gagan Agrawal, Joel H. Saltz, Raja Das
Comments (0)
books