matrix multiplication n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
MATRIX MULTIPLICATION PowerPoint Presentation
Download Presentation
MATRIX MULTIPLICATION

Loading in 2 Seconds...

play fullscreen
1 / 3

MATRIX MULTIPLICATION - PowerPoint PPT Presentation


  • 143 Views
  • Uploaded on

MATRIX MULTIPLICATION. The product of an m x n matrix A by an n x k matrix B is an m x k matrix C. The pseudo code is : procedure matrix_multiplication (A, B, C) is for i = 1 to m do for j = 1 to k do c ij = 0; for s = 1 to n do

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'MATRIX MULTIPLICATION' - race


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
matrix multiplication

MATRIX MULTIPLICATION

The product of an m x n matrix A by an n x k matrix B is an m x k matrix C.

The pseudo code is :

procedure matrix_multiplication(A, B, C) is

for i = 1 to m do

for j = 1 to k do

cij = 0;

for s = 1 to n do

cij = cij + (ais * bsj);

end for;

end for;

end for;

This procedure takes m*k*n steps.

matrix multiplication1

MATRIX MULTIPLICATION

Mesh Matrix multiplication:

matrix multiplication2

MATRIX MULTIPLICATION

Mesh Matrix Multiplication:

procedure mesh_matrix_multiplication(A, B, C)

for i = 1 to m do in parallel

for j = 1 to k do in parallel

cij = 0;

while P(i, j) receives 2 inputs a and b do

cij = cij + (a * b);

if i < m then send b to P(i +1, j )

end if;

if j<k then send a to P(i, j+1);

end if;

end while;

end for;

end for;

This procedure takes max(m,k)+n steps (latency).