Publicado

2015-05-01

Matrix multiplication with a hypercube algorithm on multi-core processor cluster

DOI:

https://doi.org/10.15446/dyna.v82n191.45513

Palabras clave:

Hypercube algorithm, multi-core processor cluster, Matrix multiplication (es)

Autores/as

  • José Crispín Zavala-Diaz Universidad Autónoma del Estado de Morelos
  • Joaquín Pérez-Ortega Departamento de Ciencias Computacionales, Centro Nacional de Investigación y Desarrollo Tecnológico,
  • Efraín Salazar-Reséndiz Departamento de Ciencias Computacionales, Centro Nacional de Investigación y Desarrollo Tecnológico,
  • Luis César Guadarrama-Rogel Departamento de Ciencias Computacionales, Centro Nacional de Investigación y Desarrollo Tecnológico,
The algorithm of multiplication of matrices of Dekel, Nassimi and Sahani or Hypercube is analysed, modified and implemented on multicore processor cluster, where the number of processors used is less than that required by the algorithm n33. 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.

Dimensions

PlumX

Visitas a la página del resumen del artículo

853

Descargas

Los datos de descarga aún no están disponibles.

Cómo citar

[1]
J. C. Zavala-Diaz, J. Pérez-Ortega, E. Salazar-Reséndiz, y L. C. Guadarrama-Rogel, «Matrix multiplication with a hypercube algorithm on multi-core processor cluster», DYNA, vol. 82, n.º 191, pp. 240–246, may 2015, doi: 10.15446/dyna.v82n191.45513.