Investigation of beowulf cluster performance for matrix multiplication and merge sort MPI program

Computing is one example because to solve a big computing in the system, it needs many processors. So, the cluster build the cluster to help the lecture and students, especially mathematics student to solve high computing. One of example is Matrix multiplication So, cluster is the solution MPI program that used in this research are Matrix multiplication and merge sort using C programming language. Computing is one example because to solve a big computing in the system, it needs many processors. So, the cluster is build to help the lecture and students, especially mathematics student to solve high computing. One of example is Matrix multiplication So, cluster is the solution A parallel programming of matrix multiplication is tested in 2 nodes, 4 nodes, 6 nodes and 8 nodes. For merge sort, it is used in 2 nodes, 4 nodes and 8. In this analysis, it shows that in matrix multiplication, more nodes that it has then the process become faster. But it doesn�t apply in merge sort programming where more nodes that it has then the process become slower. In next research, hopefully the latency and throughput are also included to determine the performance of cluster