Parallel Algorithm for Dense Matrix Multiplication

Recommendations

Info

TestObjective:Analyze speedup achieved by the parallelalgorithm when increases the size of the inputdata and the number of cores of thearchitecture.Constraints:The number of cores used must be a exactsquare root.Must be possible the exact distribution to thetotal amount of data into the available cores.
TestExecution:Run sequential algorithm on a single processor/core.For test the parallel algorithm were used thefollowing number of cores:4,9,16,25,36,49,64,100The results were obtained from the averageover three tests of the algorithms.Test per<strong>for</strong>med in matrices with dimensions up1000x1000, increasing with steps of 100.
Page 1 and 2: Parallel Algorithm forDense MatrixM
Page 3 and 4: Problem definitionGiven a matrix A(
Page 5 and 6: Problem definition (Cont.)The numbe
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: Example: Local matrix multiplicatio
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?