Skip to main content

An Implementation of the Matrix Multiplication Algorithm SUMMA in mpF

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3606))

Included in the following conference series:

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.

This research is supported by Computational and Information Aspects of Solving Large Problems program of the Division of Mathematical Sciences of the Russian Academy of Sciences.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. High Performance Fortran Forum. High Performance Fortran Language Specification, Version 2.0 (Rice University, Houston, 1997), http://dacnet.rice.edu/Depts/CRPC/HPFF/versions/hpf2/hpf-v20/index.html

  2. Message Passing Interface Forum. MPI: A Message Passing Interface Standard, Version 1.1 (June 1995), www.mpi-forum.org/docs/docs.html

  3. Report on the 1998 HPF Users Group’s annual meeting. Porto, Portugal: IEEE Comput. Sci & Eng. 5(3), 92–93 (1998)

    Google Scholar 

  4. Kalinov, A., Ledovskih, I.: An Extension of Fortran for High Performance Parallel Computing. Programming and Computer Software 30(4), 209–217 (2004); Translated from Programmirovanie 30(4) (2004)

    Article  MATH  Google Scholar 

  5. Lastovetsky, A.: Parallel Computing on Heterogeneous Networks. John Wiley & Sons, Chichester (2003)

    Book  MATH  Google Scholar 

  6. http://www.ispras.ru/~mpc

  7. van de Geijn, R., Watts, J.: SUMMA: Scalable Universal Matrix Multiplication Algorithm. Concurrency: Practice and Experience 9(4), 255–274 (1997)

    Article  Google Scholar 

  8. Blackford, L.S., Choi, J., Cleary, A., d’Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hanmmarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK User’s Guide. SIAM, Philadelphia (1997)

    Book  Google Scholar 

  9. High Performance Fortran Forum. High Performance Fortran Language Specification, Version 1.1, Rice University, Houston (1994)

    Google Scholar 

  10. The D System Home Page, http://www.cs.rice.edu/~dsystem/

  11. DVM System, http://www.keldysh.ru/pages/dvm/

  12. Foster, I., Olson, R., Tuecke, S.: Programming in Fortran M, Version 2.0, Argonne National Lab. (August 1994)

    Google Scholar 

  13. Foster, I., Kohr, D.R., Krishnaiyer, R., Choudhary, A.: A Library-Based Approach to Task Parallelism in a Data-Parallel Language. Journal of Parallel and Distributed Computing 45, 148–158 (1997)

    Article  Google Scholar 

  14. Dongarra, J.J., Du Croz, J., Duff, I.S., Hammarling, S.: A set of Level 3 Basic Linear Algebra Subprograms. ACM Transactions on Mathematical Software 16, 1–17 (1990)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalinov, A., Ledovskikh, I., Posypkin, M., Levchenko, Z., Chizhov, V. (2005). An Implementation of the Matrix Multiplication Algorithm SUMMA in mpF. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_37

Download citation

  • DOI: https://doi.org/10.1007/11535294_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics