A linear-time algorithm for computing the memory access sequence in data-parallel programs
- 1 August 1995
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (8) , 102-111
- https://doi.org/10.1145/209936.209948
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Efficient address generation for block-cyclic distributionsPublished by Association for Computing Machinery (ACM) ,1995
- Generating Communication for Array Statements: Design, Implementation, and EvaluationJournal of Parallel and Distributed Computing, 1994
- High Performance Fortran: A Practical AnalysisScientific Programming, 1994
- Compilation techniques for block-cyclic distributionsPublished by Association for Computing Machinery (ACM) ,1994
- Generating local addresses and communication sets for data-parallel programsPublished by Association for Computing Machinery (ACM) ,1993
- Compiling Fortran D for MIMD distributed-memory machinesCommunications of the ACM, 1992
- Programming in Vienna FortranScientific Programming, 1992