๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Fast Algorithm for Matrix Multiplication and Its Efficient Realization on Systolic Arrays

โœ Scribed by L.D. Elfimova; Yu.V. Kapitonova

Book ID
110353279
Publisher
Springer US
Year
2001
Tongue
English
Weight
114 KB
Volume
37
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

More efficient systolic arrays for multi
More efficient systolic arrays for multiplication in GF() using LSB first algorithm with irreducible polynomials and trinomials
โœ Soonhak Kwon; Chang Hoon Kim; Chun Pyo Hong ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 416 KB

a b s t r a c t Systolic arrays for multiplication in GFรฐ2 m รž of Yeh et al. with LSB (least significant bit) first algorithm have the unfavorable properties such as increased area complexity and bidirectional data flows compared with the arrays of Wang and Lin with MSB (most significant bit) first

A poly-algorithm for parallel dense matr
A poly-algorithm for parallel dense matrix multiplication on two-dimensional process grid topologies
โœ Li, J.; Skjellum, A.; Falgout, R. D. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 872 KB

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 int