Performance evaluation of matrix multiplication in Virtual Machine

In this paper, we have examined various implementations of matrix-matrix multiplication using .NET platform. Matrix multiplication is considered one of the basic operation in the field of linear algebra that is used various computer science algorithms. We have used the all loop reordering of traditional n3 sequential algorithm to analyze its behavior on the .NET common language run-time over more than 10 varying sizes of matrices. Moreover we have also analyzed the blocking version of the traditional multiplication algorithm to observe the cache behavior. We have used Intel Corei5 Arandale 2.53 GHz and Haswell 3.30 GHz processors with dual channel RAM for our experiments. Our experiments show that KIJ and IKJ reordering have performed better than the rest of the loop reordering. Furthermore, blocking implementation of matrix multiplication have not been able to gain significantly on .NET platform. In future, we will utilize task parallel library included in .NET 4.5 to gauge the performance efficiency of linear algebraic operations.