Abstract

In this study we analyze how to make a proper selection for the given matrix-matrix multiplication operation and to decide which is the best suitable algorithm that generates a high throughput with a minimum time, a comparison analysis and a performance evaluation for some algorithms is carried out using the identical performance parameters.

Keywords:

Algorithms for parallel matrix multiplication, linear transformation and nonlinear transformation, performance parameter measures, Processor Elements (PEs), systolic array,

References

1. Agarwal, R.C., S.M. Balle, F.G. Gustavson, M. Joshi and P. Palkar, 1995. A 3-Dimensional approach to parallel matrix multiplication. IBM J. Res. Dev., 39(5): 1-8.
   CrossRef    
2. Alpatov, P., G. Baker, C. Edwards, J. Gunnels, G. Morrow, J. Overfelt, Robert Van de GEijn and J. Wu, 1997. Plapack: Parallel linear algebra package. Proceeding of the SIAM Parallel Processing Conference.
   CrossRef    
3. Alqadi, Z. and J. Amjad, 2005. Analysis of program methods used for optimizing matrix multiplication. J. Eng., 15(1): 73-78.
   
4. Alqadi, Z., J. Amjad and M. Ibrahiem, 2008. Performance analysis and evaluation of parallel matrix multiplication algorithms. World Appl. Sci. J., 5(2): 211-214.
   
5. Bekakos, M.P., 2001. Highly Parallel Computations-algorithms and Applications. Democritus University of Thrace, Greece, pp: 139-209.
   
6. Cannon, L.E., 1969. A cellular computer to implement the kalman filter algorithm. Ph.D. Thesis, Montana State University.
   
7. Choi, J., J.J. Dongarra and D.W. Walker, 1992. Level 3 BLAS for distributed memory concurrent computers. Proceeding of Environment and Tools for Parallel Scientific Computing Workshop.
   
8. Choi, J., J.J. Dongarra and D.W. Walker, 1994. PUMMA: Parallel Universal Matrix Multiplication Algorithms on distributed memory concurrent computers. Concurrency-Pract. Ex., 6(7): 543-570.
   
9. Chtchelkanova, A., J. Gunnels, G. Morrow, J. Overfelt and R. van de Geijn, 1995. Parallel implementation of BLAS: General techniques for level 3 BLAS, TR-95-40. Department of Computer Sciences, University of Texas, OCT.
   
10. Coppersmith, D. and S. Winograd, 1990. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9: 251-280.
    CrossRef    
11. Dekel, E., D. Nassimi and S. Sahni, 1983. Parallel matrix and graph algorithms. SIAM J. Comput., 10: 657-673.
    CrossRef    
12. Gusev, M. and D.J. Evans, 1994. A new matrix vector product systolic array. J. Parallel Distr. Com., 22: 346-349.
    CrossRef    
13. Leighton, T., 1992. Introduction to Parallel Algorithms and Architectures: Arrays-trees-Hypercubes. Morgan Kaufmann, San Mateo, California.
    
14. Robinson, S., 2005. Toward an optimal algorithm for matrix multiplication. SIAM News, 38(9).
    
15. Snopce, H. and L. Elmazi, 2008a. Reducing the number of processors elements in systolic arrays for matrix multiplication using linear transformation matrix. Int. J. Comput. Commun. Control, 3: 486-490.
    
16. Snopce, H. and L. Elmazi, 2008b. The importance of using linear transformation matrix in determining the number of PEs in systolic arrays. Proceeding of ITI 2008. Cavtat, Croatia, pp: 885-892.
    
17. Strassen, V., 1969. Gaussian elimination is not optimal. Numer. Math., 13: 354-356.
    CrossRef    
18. Zhang, C.N., J.H. Weston and F.Y., Yan, 1994. Determining object functions in systolic array designs. IEEE T. VLSI Syst., 2(3): 357-360.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.