Paper Info
Title
Automatic parallel code generation for message passing on distributed memory systems
Abstract
The availability of a very accurate dependence graph for a scalar code is the basis for the automatic generation of an efficient parallel implementation. The strategy for this task which is encapsulated in a comprehensive data partitioning code generation algorithm is described. This algorithm involves the data partition, calculation of assignment ranges for partitioned arrays, addition of a comprehensive set of execution control masks, altering loop limits, addition and optimisation of communications for all data. In this context, the development and implementation of strategies to merge communications wherever possible has proved an important feature in producing efficient parallel implementations for numerical mesh based codes. The code generation strategies described here are embedded within the Computer Aided Parallelisation tools (CAPTools) software as a key part of a toolkit for automating as much as possible of the parallelisation process for mesh based numerical codes. The algorithms used enables parallelisation of real computational mechanics codes with only minor user interaction and without any prior manual customisation of the serial code to suit the parallelisation tool.
Year
DOI
Venue
1996
10.1016/0167-8191(96)00005-1
Parallel Computing
Keywords
Field
DocType
automatic parallel code generation,memory system,interprocedural dependence analysis,parallelisation tools,distributed memory,automatic parallelization,dependence analysis,computational mechanics,code generation,message passing
Computer science,Computer-aided,Parallel computing,Scalar (physics),Implementation,Code generation,Theoretical computer science,Software,Computational mechanics,Serial code,Message passing
Journal
Volume
Issue
ISSN
22
2
Parallel Computing
Citations 
PageRank 
References 
12
1.28
12
Authors
3
Name
Order
Citations
PageRank
S. P. Johnson113917.43
C. S. Ierotheou2688.27
M. Cross335429.80