Abstract
In this paper, we present a new parallel Fortran extension called mpF. The language based on both data and task parallelism allows explicit specification of data and computations distribution. We discuss some reasons for the language design and demonstrate the basic mpF features on an example of the parallel matrix multiplication algorithm SUMMA. The mpF implementation is compared with its MPI counterpart. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Kalinov, A., Ledovskikh, I., Posypkin, M., Levchenko, Z., & Chizhov, V. (2005). An implementation of the matrix multiplication algorithm SUMMA in mpF. In Lecture Notes in Computer Science (Vol. 3606, pp. 420–432). Springer Verlag. https://doi.org/10.1007/11535294_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
