Automatic parallezation of Fortran-programs. Mapping on cluster
M.S. Klinov, V.A. Krukov
The algorithms of automatic mapping on cluster of Fortran-programs are considered. The algorithms use the results of static analysis of the program, which may be added or corrected by programmer if necessary. Automatic mapping on cluster is based on building of different variants of parallelization (data and computation distributions over proccessors, and also organization of the access to remote data, located on other proccessors) and their evaluation by simulation of parallel execution of corresponding programs.
M.S. Klinov, V.A. Krukov. Automatic parallezation of Fortran-programs. Mapping on cluster // Vestnik Nizhegorodskogo universiteta im N.I. Lobachevskogo, Nizhny Novgorod: Publishing house of Nizhny Novgorod University, 2009, No. 2, P. 128-134