Scripted HTML version of Foils prepared 29 December 1996

Foil 28 Cannon's Algorithm for Matrix Multiplication

From CPS615-Linear Programming and Whirlwind Full Matrix Discussion Delivered Lectures of CPS615 Basic Simulation Track for Computational Science -- 5 Decemr 96. by Geoffrey C. Fox *
Secs 100.8
This is a similar matrix multiplication algorithm to the first in that it assumes the block definition of matrix multiply
and the calculation of each is done in place (owner computes rule) by moving the pairs of blocks and to the processor in which it resides.
Cannon's algorithm differs in the order in which the pairs of blocks are multiplied. We first "skew" both the A and the B matrix so that we can "roll" both A and B - A to the left and B to the top - to circulate the blocks in row l and column k to calculate .
Reference:
Ho, Johnsson and Edelman

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Thu Aug 14 1997