A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Matrix Multiplication is one of the most commonly used algorithm in many application areas like Sonar Systems, Relational Database Management System and other applications like algebra etc. Matrix Multiplication is quite difficult when it tends to infinity. In this paper we study and evaluate the execution time of simple matrix multiplication and optimized matrix multiplication with OpenMP on multi-core machine with same set of data values. Optimization techniques reduces space requirement anddoi:10.9790/3021-04311922 fatcat:kzepdrng7zazxlwffmj4ar2c2m