article · 2007
Compiling Data-Parallel Languages for Distributed Memory Multi-Processors
Jesshope And, C R Jesshope, C. D. Sutton
Cited by 0Abstract and details only
Abstract
This paper introduces a succinct intermediate representation for compiling high-level, data-parallel languages. It is shown how inferences applied to this representation can infer the necessary information to compile it into efficient code. Further inference procedures are being investigated in order to automatically distribute and align data objects on distributed memory multi-processors. The inferences shown in this paper are just those which infer the shape, type, rank and `sort' of data parallel operations. Shape inference and type inference create expressions (in the same representation) which evaluate to the type and shape at run-time. Thus the intermediate representation is polymorphic in terms of shape (the shape of data-parallel operations and variables) and type. Inference on an access sub-typing structure will eventually provide the mapping information. Compilers from Eval to F-code and from F-code to C exist and a new front-end compiler from FORTRAN 90 is being developed, a...
Cite this paper
And, J., Jesshope, C. R., & Sutton, C. D. (2007). Compiling Data-Parallel Languages for Distributed Memory Multi-Processors.
And, Jesshope, et al. “Compiling Data-Parallel Languages for Distributed Memory Multi-Processors.” 2007.
And, Jesshope, C R Jesshope, and C. D. Sutton. 2007. “Compiling Data-Parallel Languages for Distributed Memory Multi-Processors.”
And, J., Jesshope, C.R. and Sutton, C.D. (2007) ‘Compiling Data-Parallel Languages for Distributed Memory Multi-Processors’.
@article{and2007compiling,
title = {{Compiling Data-Parallel Languages for Distributed Memory Multi-Processors}},
author = {And, Jesshope and Jesshope, C R and Sutton, C. D.},
year = {2007}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.