Parallel Algorithms for Matrix Multiplication

Many type of problem can be converted into matrix form. If we do matrix multiplication in the efficient way many problems can be solved easily and efficiently.? This paper describes the various algorithms of Matrix Multiplication that can be implemented on parallel processing environment. Which includes Strassen’s Matrix Multiplication which can be done in O(n2.81) using sequential computing. SUMMA algorithm works in O(n2) in the parallel environment. And Matrix Multiplication that can be done on SIMD processors in O(nlogn) times.