Parallel Algorithm for Dense Matrix Multiplication

Recommendations

Info

Problem definition (Cont.)m x ra 11 a 12 a 13 b 11 b 12a 21 a 22 a 23 b 21 b 22b 31 b 32r x nThe simplest way of multiplying twomatrices takes about n 3 steps.
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 )
Page 1 and 2: Parallel Algorithm forDense MatrixM
Page 3: Problem definitionGiven a matrix A(
Page 7 and 8: AssumptionsFor simplicity, we will
Page 9 and 10: Implementation (Cont.)
Page 11 and 12: Example: These matrices are divided
Page 13 and 14: Example: Local matrix multiplicatio
Page 15 and 16: Example: Local matrix multiplicatio
Page 17 and 18: TestExecution:Run sequential algori
Page 19 and 20: Time sec.Test Results Sequential vs
Page 21 and 22: Test Results - Parallel16Speedup141
Page 23 and 24: Further work Implement the algorith
Page 25 and 26: References [1] V. Vassilevska Willi

Parallel Algorithm for Dense Matrix Multiplication

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?