Matrix Multiplication using MPI Parallel Programming Approach

Following is a matrix multiplication code written in MPI (Message Passing Interface) which could be run on CPU cluster for parallel processing. This has been successfully tested with two square matrices, each of the size 1500*1500.

I am trying to multiply two matrices of 1000x1000 size. I connected to grid lab and when I increased the number of processes, the time is also increasing which is not the case that we want. So how can we optimize this code to work efficiently when I increase the number of processes?

Hi!
My university has a cluster and i'm working on it. Your code is well commented and easy to understand, but don't run very well in the cluster. The matrix resultant calculate in cluster is wrong, because most of the elements is zero. Would you help me?

Edited
2 Years Ago
by Reverend Jim: Deleted in error. The post has been undeleted.