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 and

more »

... nsures fast execution. OpenMP is a very well known standard that exploits parallelism in shared memory architecture. The evaluation is based on simple execution of the algorithm that uses single thread for computation whereas the one with optimization techniques and OpenMP with multi-threads.