A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array | Zendy

Sung Eun Bae | Zendy; Tong-Wook Shinn | Zendy; Tadao Takaoka | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array

Author(s) -

Sung Eun Bae,

Tong-Wook Shinn,

Tadao Takaoka

Publication year - 2014

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2014.05.208

Subject(s) - multiplication (music) , computer science , matrix multiplication , square (algebra) , matrix (chemical analysis) , algorithm , square matrix , multiplication algorithm , arithmetic , mathematics , symmetric matrix , combinatorics , geometry , physics , eigenvalues and eigenvectors , materials science , quantum mechanics , binary number , composite material , quantum

Matrix multiplication is a fundamental mathematical operation that has numerous applications across most scientific fields. Cannon's distributed algorithm to multiply two n-by-n matrices on a two dimensional square mesh array with n2 cells takes exactly 3n − 2 communication steps to complete. We show that it is possible to perform matrix multiplication in just 1.5n − 1 communication steps on a two dimensional square mesh array of the same size, thus halving the number of steps required

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research