| 1 | [[PageOutline]] |
| 2 | |
| 3 | = Application Name = |
| 4 | |
| 5 | Matmul Files |
| 6 | |
| 7 | = Summary = |
| 8 | |
| 9 | * '''Name''': {{{Matmul Files}}} |
| 10 | * '''Contact Person''': {{{support-compss@bsc.es}}} |
| 11 | * '''Access Level''': {{{public}}} |
| 12 | * '''License Agreement''': {{{Apache2}}} |
| 13 | * '''Platform''': {{{COMPSs}}} |
| 14 | * '''Repository''': [[https://compss.bsc.es/svn/bar/apps/c/matmul|Matmul Files]] |
| 15 | |
| 16 | |
| 17 | == Description == |
| 18 | Matrix multiplication is a binary operation that takes a pair of matrices and produces another matrix. |
| 19 | |
| 20 | If A is an n×m matrix and B is an m×p matrix, the result AB of their multiplication is an n×p matrix defined only if the number of columns m in A is equal to the number of rows m in B. When multiplying A and B, the elements of the rows in A are multiplied with corresponding columns in B. |
| 21 | |
| 22 | In this implementation, A and B are square matrices (same number of rows and columns), and so it is the result matrix C. Each matrix is divided in N blocks of M doubles. The multiplication of two blocks is done by a multiply task method with a simple three-nested-loop implementation. When executed with COMPSs, the main program generates N^3^ tasks arranged as N^2^ chains of N tasks in the dependency graph. |
| 23 | |
| 24 | == Execution instructions == |
| 25 | Usage: |
| 26 | runcompss matmul <numberOfBlocks> <blockSize> |
| 27 | |
| 28 | where: |
| 29 | * - numberOfBlocks: Number of blocks inside each matrix |
| 30 | * - blockSize: Size of each block |
| 31 | |
| 32 | == Execution Example == |
| 33 | runcompss matmul 16 4 |
| 34 | |
| 35 | |
| 36 | == Build == |
| 37 | buildapp matmul |