Interprocedural partial redundancy elimination and its application to distributed memory compilation

Gagan Agrawal, Joel Saltz, Raja Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 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)
Title of host publicationProceedings of the ACM SIGPLAN 1995 Conference on Programming language Design and Implementation, PLDI 1995
PublisherAssociation for Computing Machinery
Pages258-269
Number of pages12
ISBN (Electronic)0897916972
DOIs
StatePublished - Jun 18 1995
Event1995 ACM SIGPLAN Conference on Programming language Design and Implementation, PLDI 1995 - San Diego, United States
Duration: Jun 18 1995Jun 21 1995

Publication series

NameProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
VolumePart F129371

Conference

Conference1995 ACM SIGPLAN Conference on Programming language Design and Implementation, PLDI 1995
CountryUnited States
CitySan Diego
Period6/18/956/21/95

ASJC Scopus subject areas

  • Software

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