An implementation of the matrix multiplication algorithm SUMMA in mpf

Authors:
Alexey Kalinov;Ilya Ledovskikh;Mikhail Posypkin;Zakhar Levchenko;Vladimir Chizhov
Affiliations:
Institute for System Programming of the Russian Academy of Sciences, Moscow, Russia;Institute for System Programming of the Russian Academy of Sciences, Moscow, Russia;Institute for System Programming of the Russian Academy of Sciences, Moscow, Russia;Institute for System Programming of the Russian Academy of Sciences, Moscow, Russia;Institute for System Programming of the Russian Academy of Sciences, Moscow, Russia
Venue:
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Year:
2005

Citing 5
Cited 1

A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
ScaLAPACK user's guide

ScaLAPACK user's guide
A library-based approach to task parallelism in a data-parallel language

Journal of Parallel and Distributed Computing
Parallel Computing on Heterogeneous Networks

Parallel Computing on Heterogeneous Networks
An Extension of Fortran for High Performance Parallel Computing

Programming and Computing Software

A fortran evolution of mpc parallel programming language

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.