Performance of one-level recursion parallel Strassen's algorithm on dual core processor

Abstract

Matrix multiplication is presumably one of the most important techniques in many scientific applications. Efficient implementation of this technique on the ubiquitous multi-cores is therefore critical to the performance of this broad range of applications. The execution time of sequential and parallel implementation of the algorithms were measured, analyzed and interpreted. The main aim of this research work is to compare the speedup obtainable from executing one-level recursion parallel Strassen's matrix multiplication algorithm on multi-core processors. The programs were written in C++/OpenMP. The result of the research work showed significant performance of the parallel programs of the Strassen's algorithm for large matrix size. It was also observed that Strassen's algorithm performs better for large matrix size while having the same performance as the Traditional algorithm for small matrices. The result suggested that with one step recursion, for both small and large matrix sizes Strassen's algorithm is the best choice.