Automatic parallel code generation for message passing on distributed memory systems

Parallel Computing

Volumn 22, Issue 2, 1996, Pages 227-258

  Johnson, S P ^a   Ierotheou, C S ^a   Cross, M ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Automatic parallel code generation; Interprocedural dependence analysis; Parallelisation tools

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SOFTWARE; DATA COMMUNICATION SYSTEMS; DATA PROCESSING; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY;

AUTOMATIC PARALLEL CODE GENERATION; COMPUTER AIDED PARALLELIZATION TOOLS (CAPTOOLS); DATA PARTITIONING; DEPENDENCE GRAPHS; DISTRIBUTED MEMORY SYSTEMS; INTERPROCEDURAL DEPENDENCE ANALYSIS; MESSAGE PASSING;

PARALLEL PROCESSING SYSTEMS;

EID: 0030082780     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(96)00005-1     Document Type: Article

References (26)

1. D.A. Padua and M.J. Wolfe, Advanced compiler optimisations for supercomputers in Commun. ACM (1986) 1184-1201.
2. J.R. Allen and K. Kennedy, Automatic translation of FORTRAN programs to vector form., ACM Trans. Programming Languages and Systems, 9 (1987) 491-542.
3. C.D. Polychronopoulos and U. Banerjee, Processor allocation for horizontal and vertical speedup bounds, IEEE Trans. Computers C-36 (1987).
4. C.D. Polychronopoulos, Parallel Programming and Compilers (Kluwer, Boston, MA, 1988).
5. S. Hiranandani, K. Kennedy and C. Tseng, Compiling Fortran D for MIMD distributed memory machines, Commun. ACM 35(8) (1992) 66-80.
6. S. Hiranandani, K. Kennedy, J.M. Crummy and A. Sethi, Advanced compiler techniques for Fortran D, Technical Report CRPC-TR93338, Centre For Research On Parallel Computation, Rice University, Houston, Texas, 1993.
7. P. Mehrotra and J. Van Rosendale, High level programming of distributed memory architectures, in: Advances in Languages and Compilers for Parallel Processing (Pitman Press, 1991) 369-384.
8. B.M. Chapman et al., Vienna Fortran compilation system, User guide version 1.0, Dept of Statistics and Computer Science, University Of Vienna, Austria, 1994.
9. H. Zima and B. Chapman, Compiling for distributed memory systems, Technical Report, Institute For Statistics and Computer Science, University of Vienna, 1994.
10. E. Su, J. Palermo and P. Banerjee, Automating parallelization of regular computations for distributed memory multicomputers in the Paradigm compiler, Int. Conf. on Parallel Processing, St. Charles, Illinois, (Aug. 1993).
11. S.P. Amarasinghe and M.S. Lam, Communication optimization and code generation for distributed memory machines, in: ACM Conf. on Programming Languages Design and Implementation (1993) 126-138.
12. M. Cross, S.P. Johnson and P. Chow, Mapping enthalpy based solidification algorithms onto vector and parallel architectures, Applied Math. Modelling 13 (1989) 702-709.
13. S.P. Johnson and M. Cross, Mapping structured grid three dimensional CFD codes onto parallel architectures, Applied Math Modelling 15 (1991) 394-405.
14. S.P. Johnson, F. Ali and M. Cross, Parallelising of the FAMCALC FEA code, University of Greenwich Technical Report, 1992.
15. P.F. Leggett, Parallelisation of FACET, University of Greenwich Technical Report, 1991.
16. H.P. Zima, H.J. Bast and M. Gerndt, SUPERB: A tool for semi automatic MIMD/SIMD parallelisation, Parallel Computing 6 (1988) 1-18.
17. H.P. Zima, Supercompilers for parallel and vector computers, (ACM Press, New York, 1990).
18. S.P. Johnson, M. Cross and M.G. Everett, Exploitation of symbolic information in interprocedural dependence analysis, Parallel Computing 22(2) (1996), this issue.
19. A. Schrijver Theory of Linear and Integer Programming (John Wiley, 1986).
20. C.S. Ierotheou, S.P. Johnson, M. Cross and P.F. Leggett, Computer Aided Parallelisation Tools (CAPTools) - Conceptual overview and performance on the parallelisation of structured mesh codes, Parallel Computing 22(2) (1996), this issue.
21. P.F. Leggett, A.T.J. Marsh, S.P. Johnson and M. Cross, Integrating user knowledge with information from parallelisation tools to facilitate the automatic generation of efficient parallel FORTRAN code, Parallel Computing 22(2) (1996), this issue.
22. J. Li and M. Chen, Index domain alignment: Minimizing cost of cross-referencing between distributed arrays, Frontiers 90: Third Symp. on the Frontiers of Massively Parallel Computation, College Park, MD (Oct. 1990).
23. M. Gupta and P. Banerjee, PARADIGM: A compiler for automatic data distribution on multicomputers, ACM Int. Conf. on Supercomputing, Tokyo, Japan (July 1993).
24. J. Ramanujam and P. Sadayappan, Compile-time techniques for data distribution in distributed memory machines, IEEE Trans. Parallel Distributed Systems 2(4) (1991) 472-482.
25. E.W. Evans, S.P. Johnson and M. Cross, Automatic generation of asynchronous communication in a parallelisation tool, in preparation, University of Greenwich.
26. K. McManus, A strategy for mapping unstructured mesh computational mechanics programs onto distributed memory parallel architectures, PhD Thesis, University of Greenwich, 1995.