Interprocedural Partial Redundancy Elimination and Its Application To Distributed Memory Compilation

Gagan Agrawal; Joel Saltz; Raja Das

doi:10.1145/223428.207157

Interprocedural Partial Redundancy Elimination and Its Application To Distributed Memory Compilation

Gagan Agrawal, Joel Saltz, Raja Das

Research output: Contribution to journal › Article › peer-review

28 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	258-269
Number of pages	12
Journal	ACM SIGPLAN Notices
Volume	30
Issue number	6
DOIs	https://doi.org/10.1145/223428.207157
State	Published - Jan 6 1995
Externally published	Yes

ASJC Scopus subject areas

Software
Computer Graphics and Computer-Aided Design

Access to Document

10.1145/223428.207157

Cite this

@article{d82e18d007f94e8d89458e88d965a73b,

title = "Interprocedural Partial Redundancy Elimination and Its Application To Distributed Memory Compilation",

abstract = "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.",

author = "Gagan Agrawal and Joel Saltz and Raja Das",

year = "1995",

month = jan,

day = "6",

doi = "10.1145/223428.207157",

language = "English (US)",

volume = "30",

pages = "258--269",

journal = "ACM SIGPLAN Notices",

issn = "0362-1340",

publisher = "Association for Computing Machinery (ACM)",

number = "6",

}

TY - JOUR

T1 - Interprocedural Partial Redundancy Elimination and Its Application To Distributed Memory Compilation

AU - Agrawal, Gagan

AU - Saltz, Joel

AU - Das, Raja

PY - 1995/1/6

Y1 - 1995/1/6

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 - http://www.scopus.com/inward/record.url?scp=84976815257&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976815257&partnerID=8YFLogxK

U2 - 10.1145/223428.207157

DO - 10.1145/223428.207157

M3 - Article

AN - SCOPUS:84976815257

SN - 0362-1340

VL - 30

SP - 258

EP - 269

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

IS - 6

ER -

Interprocedural Partial Redundancy Elimination and Its Application To Distributed Memory Compilation

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this