Simplification of array access patterns for compiler optimizations
- 1 May 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 33 (5) , 60-71
- https://doi.org/10.1145/277650.277664
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Parallel programming with PolarisComputer, 1996
- Generating Local Addresses and Communication Sets for Data-Parallel ProgramsJournal of Parallel and Distributed Computing, 1995
- Symbolic array dataflow analysis for array privatization and program parallelizationPublished by Association for Computing Machinery (ACM) ,1995
- Evaluating Compiler Optimizations for Fortran DJournal of Parallel and Distributed Computing, 1994
- Parallel programming in Split-CPublished by Association for Computing Machinery (ACM) ,1993
- A practical algorithm for exact array dependence analysisCommunications of the ACM, 1992
- An empirical study of Fortran programs for parallelizing compilersIEEE Transactions on Parallel and Distributed Systems, 1990
- An efficient data dependence analysis for parallelizing compilersIEEE Transactions on Parallel and Distributed Systems, 1990
- Analysis of interprocedural side effects in a parallel programming environmentJournal of Parallel and Distributed Computing, 1988
- Interprocedural dependence analysis and parallelizationPublished by Association for Computing Machinery (ACM) ,1986