Can I read A Poly-algorithm for Parallel Dense Matrix Multiplication on Two-dimensional Process Grid Topologies on EtoBox?

A Poly-algorithm for Parallel Dense Matrix Multiplication on Two-dimensional Process Grid Topologies by Li, J.; Skjellum, A.; Falgout, R. D. is a Computer Science article available to read on EtoBox.

What is A Poly-algorithm for Parallel Dense Matrix Multiplication on Two-dimensional Process Grid Topologies about?

In this paper, we present several new and generalized parallel dense matrix multiplication algorithms of the form C = αAB + βC on two-dimensional process grid topologies. These algorithms can deal with rectangular matrices distributed on rectangular grids. We classify these algorithms coherently into three categories according to the communication primitives used and thus we offer a taxonomy for this family of related algorithms. All these algorithms are represented in the data distribution independent approach and thus do not require a specific data distribution for correctness. The algorithmic compatibility condition result shown here ensures the correctness of the matrix multiplication. We define and extend the data distribution functions and introduce permutation compatibility and algorithmic compatibility. We also discuss a permutation compatible data distribution (modified virtual 2D data distribution). We conclude that no single algorithm always achieves the best performance on different matrix and grid shapes. A practical approach to resolve this dilemma is to use poly-algorithms. We analyze the characteristics of each of these matrix multiplication algorithms and provide i

Who reads A Poly-algorithm for Parallel Dense Matrix Multiplication on Two-dimensional Process Grid Topologies?

Author

Li, J.; Skjellum, A.; Falgout, R. D.

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 1040-3108)

Published

1997

Language

EN

Field

Computer Science (Physical Sciences)