Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
DYNA
Print version ISSN 0012-7353
Abstract
ZAVALA-DIAZ, José Crispín; PEREZ-ORTEGA, Joaquín; SALAZAR-RESENDIZ, Efraín and GUADARRAMA-ROGEL, Luis César. Matrix multiplication with a hypercube algorithm on multi-core processor cluster. Dyna rev.fac.nac.minas [online]. 2015, vol.82, n.191, pp.240-246. ISSN 0012-7353. https://doi.org/10.15446/dyna.v82n191.45513.
The algorithm of multiplication of matrices of Dekel, Nassimi and Sahani or Hypercube is analysed, modified and implemented on multi-core processor cluster, where the number of processors used is less than that required by the algorithm n3. 23, 43 and 83 processing units are used to multiply matrices of the order of 10x10, 102x102 and 103X103. The results of the mathematical model of the modified algorithm and those obtained from the computational experiments show that it is possible to reach acceptable speedup and parallel efficiencies, based on the number of used processor units. It also shows that the influence of the external communication link among the nodes is reduced if a combination of the available communication channels among the cores in a multi-core cluster is used.
Keywords : Hypercube algorithm; multi-core processor cluster; Matrix multiplication.