To search, Click below search items.


All Published Papers Search Service


Matrix Multiplication Algorithms


Khaled Thabet, Sumaia AL-Ghuribi


Vol. 12  No. 2  pp. 74-79


Algorithm can be written in various ways, executes sequential or parallel, and gives the same results. One of the main factors of determining the efficient of an algorithm is the execution time factor, how much time the algorithm takes to accomplish its work. Because matrix multiplication widely used in a variety of applications and is often one of the core components of many scientific computations, it will be taken as a problem in this work and different algorithms are given to solve this problem. Then the execution time of all the methods will be calculated to find the best method for matrix multiplication. After testing Twenty three methods, we find that parallel Strassen algorithm is the best method for finding matrix multiplication.


Algorithm, parallel execution, matrix multiplication, Strassen algorithm