An Automatic and Symbolic Parallelization System for Distributed Memory Parallel Computers
- Creators
- Ikudome, K.
- Fox, G. C.
- Kolawa, A.
- Flower, J. W.
Abstract
This paper describes ASPAR (Automatic and Symbolic PARallelization) which consists of a source-to-source parallelizer and a set of interactive graphic tools. While the issues of data dependency have already been explored and used in many parallel computer systems such as vector and shared memory machines, distributed memory parallel computers require, in addition, explicit data decomposition. New symbolic analysis and data-dependency analysis methods are used to determine an explicit data decomposition scheme. Automatic parallelization models using high level communications are also described in this paper. The target applications are of the "regular-mesh" type typical of many scientific calculations. The system has been implemented for the language C, and is designed for easy modification for other languages such as Fortran.
Additional Information
© 1990 IEEE.Attached Files
Published - 00556323.pdf
Files
Name | Size | Download all |
---|---|---|
md5:f3cdb9ec05300312a2be8cbe85051249
|
960.8 kB | Preview Download |
Additional details
- Eprint ID
- 78675
- Resolver ID
- CaltechAUTHORS:20170628-152256756
- Created
-
2017-06-29Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field