Matrix multiplication with a hypercube algorithm on multi-core processor cluster
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 n³. 2³, 4³ and 8³ processing units are used to multiply matrices of the order of 10x10, 10²x10² and 10³X10³. 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.
| Main Authors: | , , , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Universidad Nacional de Colombia
2015
|
| Online Access: | http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0012-73532015000300030 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|