Skip to main content
SpringerLink
Log in

An approach to scalability of parallel matrix multiplication algorithms

  • Session 15: Parallel and Distributed Computing III
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1276))

Included in the following conference series:

Abstract

In this paper, we start with presenting and defining scalability of algorithm-architecture combinations based on the fixed ratio of computation time to communication cost, analyze the performance and scalability of a number of parallel matrix multiplication algorithms, and compare them with the related work. The performance analysis and the analytical scalability expressions for these algorithms show that our scalability metric is better than the isoefficiency metric.

This work is supported by Chinese National 863 Hi-Tech R&D Project

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berntsen, J.: Communication efficient matrix multiplication on hypercubes, Parallel Computing 12 (1989) 335–342

    Google Scholar 

  2. Cannon, L.E.: A cellular computer to implement the Kalman Filter Algorithm, PH.D. Thesis, Montana State University (1969)

    Google Scholar 

  3. Dekel, E., Nassimi, D., and S. Sahni, S.: Parallel matrix and graph algorithms, SIAM Journal of Computing 10 (1981) 657–673

    Google Scholar 

  4. Fox, G.C., et al.: Matrix algorithms on a hypercube I: Matrix multiplication, Parallel Computing 4 (1987) 17–31

    Google Scholar 

  5. Grama, A.Y., et al.: Isoefficiency: Measuring the scalability of parallel algorithms and architectures, IEEE Parallel and Distributed Technology (1993) 12–21

    Google Scholar 

  6. Gupta, A., V. Kumar, V.: Scalability of Parallel Algorithms for Matrix Multiplication, in: Proc. of 1993 Intern. Conf. on Parallel Processing 115–123

    Google Scholar 

  7. Kumar, V., et al.: Introduction to Parallel Computing-Design and Analysis of Algorithms, The Benjamin/ Cummings Publishing Company, Inc. (1994)

    Google Scholar 

  8. Wu, Xingfu, Li, Wei: Performance Models for Scalable Cluster Computing, Journal of Systems Architecture, Elsevier Science Publishers B.V.(North-Holland) (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research Center for Intelligent Computing Systems Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing, China

    Xingfu Wu

Authors
  1. Xingfu Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, X. (1997). An approach to scalability of parallel matrix multiplication algorithms. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045116

Download citation

  • DOI: https://doi.org/10.1007/BFb0045116

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation