Show simple item record

Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation

dc.contributor.authorAgrawal, Gaganen_US
dc.contributor.authorSaltz, Joelen_US
dc.contributor.authorDas, Rajaen_US
dc.date.accessioned2004-05-31T22:31:32Z
dc.date.available2004-05-31T22:31:32Z
dc.date.created1995-03en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/716
dc.description.abstractPartial 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. (Also cross-referenced as UMIACS-TR-95-42)en_US
dc.format.extent231768 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3446en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-42en_US
dc.titleInterprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilationen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record