Parallel Algorithm for Dense Matrix Multiplication
1flkyiM
1flkyiM
- No tags were found...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Problem definition (Cont.)The number of operation required to multiplyA x B is:m × n × (2r-1)For simplicity, usually it is analyzed in termsof square matrices of order n. So that thequantity of basic operations between scalarsis :2n 3 - n 2 = O(n 3 )