International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 29 - Issue 8 |
Published: September 2011 |
Authors: Satya Prakash, Anil K. Ahlawat |
![]() |
Satya Prakash, Anil K. Ahlawat . A New Approach for Representation of Multi-dimensional Matrix Multiplication Operations. International Journal of Computer Applications. 29, 8 (September 2011), 37-43. DOI=10.5120/4195-4968
@article{ 10.5120/4195-4968, author = { Satya Prakash,Anil K. Ahlawat }, title = { A New Approach for Representation of Multi-dimensional Matrix Multiplication Operations }, journal = { International Journal of Computer Applications }, year = { 2011 }, volume = { 29 }, number = { 8 }, pages = { 37-43 }, doi = { 10.5120/4195-4968 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2011 %A Satya Prakash %A Anil K. Ahlawat %T A New Approach for Representation of Multi-dimensional Matrix Multiplication Operations%T %J International Journal of Computer Applications %V 29 %N 8 %P 37-43 %R 10.5120/4195-4968 %I Foundation of Computer Science (FCS), NY, USA
In this paper, the extended Karnaugh Map representation (EKMR) scheme has been proposed as an alternative to the traditional matrix representation (TMR) which caused the multi-dimensional array operation to be inefficient when extended to dimensions higher than two. Multi-dimensional arrays are widely used in a lot of scientific studies but still some issues have been encountered regarding efficient operations of these multi-dimensional arrays. EKMR scheme has managed to successfully optimize the performance of the multi-dimensional array operations to the 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 a rectangular map which holds all the possible values of the Boolean expression. Then the efficient data parallel algorithms for multi-dimensional matrix multiplication operation using EKMR are presented in this study which outperformed those data parallel algorithms for multi-dimensional matrix multiplication operation which used the TMR scheme. The study encourages designing data parallel algorithms for multi-dimensional dense and sparse multi-dimensional arrays for other operations as well using the EKMR scheme since this scheme produces the efficient performance for all dimensions and for all operations of the arrays.