-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathL11Ex5.cpp
67 lines (54 loc) · 1.85 KB
/
L11Ex5.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>
#define INCLUDE_DIAGONAL 1
#define lower_triangle_size_with_diagonal(m_size) (m_size * m_size - m_size) / 2 + m_size
#define lower_triangle_size_without_diagonal(m_size) (m_size * m_size - m_size) / 2
#define lower_tiangle_size(m_size) INCLUDE_DIAGONAL ? lower_triangle_size_with_diagonal(m_size) : lower_triangle_size_without_diagonal(m_size)
void printMatrix(int *matrix, int size) {
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
printf("%5d", matrix[i * size + j]);
}
printf("\n");
}
}
int main(int argc, char* argv[])
{
int size, myrank;
MPI_Init(&argc, &argv);
MPI_Comm_size(MPI_COMM_WORLD, &size);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
int m_size;
int *matrixA, *matrixB;
if (myrank == 0) {
printf("Input matrix size:\n");
scanf("%d", &m_size);
matrixA = (int*)malloc(m_size * m_size * sizeof(int));
matrixB = (int*)malloc(m_size * m_size * sizeof(int));
for (int i = 0; i < m_size * m_size; i++) {
matrixA[i] = i;
matrixB[i] = -i;
}
printf("== A ==\n");
printMatrix(matrixA, m_size);
printf("== B ==\n");
printMatrix(matrixB, m_size);
int lengths[m_size], displacements[m_size];
for (int i = 0; i < m_size; i++) {
lengths[i] = INCLUDE_DIAGONAL ? i + 1 : i;
displacements[i] = i*m_size;
}
MPI_Datatype lower_triangle_type;
MPI_Type_indexed(m_size, lengths, displacements, MPI_INT, &lower_triangle_type);
MPI_Type_commit(&lower_triangle_type);
MPI_Send(matrixA, 1, lower_triangle_type, 0, 111, MPI_COMM_WORLD);
MPI_Recv(matrixB, 1, lower_triangle_type, 0, 111, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
printf("== A ==\n");
printMatrix(matrixA, m_size);
printf("== B ==\n");
printMatrix(matrixB, m_size);
}
MPI_Finalize();
return 0;
}