Basic HTML version of Foils prepared 6 December 96

Foil 37 Performance Analysis of Cannon's Algorithm

From Full Matrices - December 4, 1995 CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95. by Geoffrey C. Fox, Nancy J. McCracken
1 Set-up
  • Time to skew A - we assume that the row shifts occur independently and are optimized to take the shortest path. We ignore start-up and note that each subblock is moved /2 positions. The answer is as usual architecture dependent and could be much better than estimate with dependence.
  • Time to skew B is the same.
2 Time for each of iterations
  • Computing C = AB
  • Time to roll A
  • Time to roll B is the same.
3 Total time
in Table To:

© on Tue Oct 7 1997