Improving Matrix Multiplication Using Parallel Computing
Haitham A. Alasha'ary, Khaled Matrouk, Abdullah I. Alhasanat, Ziad Alqadi, Hasan Al-Shalabi · International Journal on Information Technology (IREIT) · 2013
Multiplication of large matrices requires a lot of computation time as its complexity is O(n3). Because most image processing applications require higher computational throughputs with minimum time, many sequential and parallel algorithms are developed. In this paper, a method of matrix multiplication was chosen, and analyzed. A performance analysis was evaluated, and it was seen that the chosen method was very powerful when dealing with matrices with large sizes and implementing the method using parallel computing based on openMP libraries