TY - GEN
T1 - Interprocedural partial redundancy elimination and its application to distributed memory compilation
AU - Agrawal, Gagan
AU - Saltz, Joel
AU - Das, Raja
N1 - Publisher Copyright:
© 1995 ACM.
PY - 1995/6/18
Y1 - 1995/6/18
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84877697881
U2 - 10.1145/207110.207157
DO - 10.1145/207110.207157
M3 - Conference contribution
AN - SCOPUS:84877697881
T3 - Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
SP - 258
EP - 269
BT - Proceedings of the ACM SIGPLAN 1995 Conference on Programming language Design and Implementation, PLDI 1995
PB - Association for Computing Machinery
T2 - 1995 ACM SIGPLAN Conference on Programming language Design and Implementation, PLDI 1995
Y2 - 18 June 1995 through 21 June 1995
ER -