Compiling global name-space parallel loops for distributed execution
Authors:
- C. KoelbelCKC. Koelbel
- P. MehrotraPMP. Mehrotra
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 2 (4) , 440-451
Abstract
Compiler support required to allow programmers to express their algorithms using a global name-space is discussed. A general method for the analysis of a high-level source program and its translation into a set of independently executing tasks that communicate using messages is presented. It is shown that if the compiler has enough information, the translation can be carried out at compile time. Otherwise, run-time code is generated to implement the required data movement. The analysis required in both situations is described, and the performance of the generated code on the Intel iPSC/2 hypercube is presented.Keywords
This publication has 14 references indexed in Scilit:
- An empirical study of Fortran programs for parallelizing compilersIEEE Transactions on Parallel and Distributed Systems, 1990
- A method for parallel program generation with an application to the Booster language1990
- Pandore1990
- Munin: distributed shared memory based on type-specific memory coherence1990
- The Amber system: parallel programming on a network of multiprocessors1989
- Compiling programs for distributed-memory multiprocessorsThe Journal of Supercomputing, 1988
- Multigrid solution of the two-dimensional Euler equations on unstructured triangular meshesAIAA Journal, 1988
- SUPERB: A tool for semi-automatic MIMD/SIMD parallelizationParallel Computing, 1988
- The BLAZE language: A parallel language for scientific programmingParallel Computing, 1987
- Semi-automatic process partitioning for parallel computationInternational Journal of Parallel Programming, 1987