Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
| dc.contributor.author | Agrawal, Gagan | en_US |
| dc.contributor.author | Saltz, Joel | en_US |
| dc.contributor.author | Das, Raja | en_US |
| dc.date.accessioned | 2004-05-31T22:31:32Z | |
| dc.date.available | 2004-05-31T22:31:32Z | |
| dc.date.created | 1995-03 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.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. (Also cross-referenced as UMIACS-TR-95-42) | en_US |
| dc.format.extent | 231768 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/716 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3446 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-95-42 | en_US |
| dc.title | Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation | en_US |
| dc.type | Technical Report | en_US |