Interprocedural partial redundancy elimination and its application to distributed memory compilation
- 1 June 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (6) , 258-269
- https://doi.org/10.1145/207110.207157
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Design and implementation of a parallel unstructured Euler solver using software primitivesAIAA Journal, 1994
- Efficient computation of interprocedural definition-use chainsACM Transactions on Programming Languages and Systems, 1994
- Interprocedural optimizationACM Transactions on Programming Languages and Systems, 1993
- An elimination algorithm for bidirectional data flow problems using edge placementACM Transactions on Programming Languages and Systems, 1993
- Compiling Fortran D for MIMD distributed-memory machinesCommunications of the ACM, 1992
- An interval-based approach to exhaustive and incremental interprocedural data-flow analysisACM Transactions on Programming Languages and Systems, 1990
- Run-time scheduling and execution of loops on message passing machinesJournal of Parallel and Distributed Computing, 1990
- Some comments on “A solution to a problem with Morel and Renvoise's 'Global optimization by suppression of partial redundancies'”ACM Transactions on Programming Languages and Systems, 1989
- A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”ACM Transactions on Programming Languages and Systems, 1988
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979