Efficient Algorithm for Multi-Dimensional Matrix Multiplication Operations Representation

Multi-dimensional arrays are widely used in a lot of scientific studies but still some issues have been encountered regarding efficientoperations of these multi-dimensional arrays. In this paper, the extended Karnaugh Map representation (EKMR) scheme has been proposed as analternative to the traditional matrix representation (TMR) which caused the multi-dimensional array operation to be inefficient when extended todimensions higher than two. EKMR scheme has managed to successfully optimize the performance of the multi-dimensional array operations tothe nth dimension of the array. The basic concept EKMR is to transform the multi-dimensional array in to a set of two-dimensional arrays. EKMR scheme implies Karnaugh Map which is a technique used to reduce a Boolean expression. It is commonly represented with the help of arectangular map which holds all the possible values of the Boolean expression. Then the efficient data parallel algorithms for multi-dimensionalmatrix multiplication operation using EKMR are presented in this study which outperformed those data parallel algorithms for multidimensionalmatrix multiplication operation which used the TMR scheme. The study encourages designing data parallel algorithms for multidimensionaldense and sparse multi-dimensional arrays for other operations as well using the EKMR scheme since this scheme produces theefficient performance for all dimensions and for all operations of the arrays