TY - JOUR
T1 - Fortran-P translator
T2 - towards automatic translation of Fortran 77 programs for massively parallel processors
AU - O'Keefe, Matthew
AU - Parr, Terence
AU - Edgar, B. Kevin
AU - Anderson, Steve
AU - Woodward, Paul
AU - Dietz, Hank
PY - 1995/3
Y1 - 1995/3
N2 - Massively parallel processors (MPPs) hold the promise of extremely high performance that, if realized, could be used to study problems of unprecedented size and complexity. One of the primary stumbling blocks to this promise has been the lack of tools to translate application codes to MPP form. In this article we show how applications codes written in a subset of Fortran 77, called Fortran-P, can be translated to achieve good performance on several massively parallel machines. This subset can express codes that are self-similar, where the algorithm applied to the global data domain is also applied to each subdomain. We have found many codes that match the Fortran-P programming style and have converted them using our tools. We believe a self-similar coding style will accomplish what a vectorizable style has accomplished for vector machines by allowing the construction of robust, user-friendly, automatic translation systems that increase programmer productivity and generate fast, efficient code for MPPs.
AB - Massively parallel processors (MPPs) hold the promise of extremely high performance that, if realized, could be used to study problems of unprecedented size and complexity. One of the primary stumbling blocks to this promise has been the lack of tools to translate application codes to MPP form. In this article we show how applications codes written in a subset of Fortran 77, called Fortran-P, can be translated to achieve good performance on several massively parallel machines. This subset can express codes that are self-similar, where the algorithm applied to the global data domain is also applied to each subdomain. We have found many codes that match the Fortran-P programming style and have converted them using our tools. We believe a self-similar coding style will accomplish what a vectorizable style has accomplished for vector machines by allowing the construction of robust, user-friendly, automatic translation systems that increase programmer productivity and generate fast, efficient code for MPPs.
UR - http://www.scopus.com/inward/record.url?scp=0029270709&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029270709&partnerID=8YFLogxK
U2 - 10.1155/1995/278064
DO - 10.1155/1995/278064
M3 - Article
AN - SCOPUS:0029270709
SN - 1058-9244
VL - 4
SP - 1
EP - 21
JO - Scientific Programming
JF - Scientific Programming
IS - 1
ER -