Basic HTML version of Foils prepared 6 December 96

Foil 46 Performance Analysis of the Parallel LU Decomposition

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 block size m = M/ initially and it will change and become 1 at end as rows and columns are eliminated
2 Then time for one iteration of algorithm
  • Time to select pivot row which is typical
  • logarithmic time reduction algorithm
  • Time to send rows r and k (which may be possible
  • to be overlapped in same communication time)
  • Time to broadcast pivot row
  • Time to divide column k
  • Time to broadcast pivot column
  • Time to transform rows
  • Total time for one iteration
in Table To:

© on Tue Oct 7 1997