Interprocedural Partial Redundancy Elimination and Its Application To Distributed Memory Compilation

Gagan Agrawal, Joel Saltz, Raja Das

Research output: Contribution to journalArticlepeer-review

26 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 languageEnglish (US)
Pages (from-to)258-269
Number of pages12
JournalACM SIGPLAN Notices
Volume30
Issue number6
DOIs
StatePublished - Jan 6 1995
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'Interprocedural Partial Redundancy Elimination and Its Application To Distributed Memory Compilation'. Together they form a unique fingerprint.

Cite this