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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include "mpi.h"
#include <stdio.h>
#include "mpitest.h"
void addem(int *, int *, int *, MPI_Datatype *);
void assoc(int *, int *, int *, MPI_Datatype *);
void addem(int *invec, int *inoutvec, int *len, MPI_Datatype * dtype)
{
int i;
for (i = 0; i < *len; i++)
inoutvec[i] += invec[i];
}
#define BAD_ANSWER 100000
/*
The operation is inoutvec[i] = invec[i] op inoutvec[i]
(see 4.9.4). The order is important.
Note that the computation is in process rank (in the communicator)
order, independent of the root.
*/
void assoc(int *invec, int *inoutvec, int *len, MPI_Datatype * dtype)
{
int i;
for (i = 0; i < *len; i++) {
if (inoutvec[i] <= invec[i]) {
int rank;
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
fprintf(stderr, "[%d] inout[0] = %d, in[0] = %d\n", rank, inoutvec[0], invec[0]);
inoutvec[i] = BAD_ANSWER;
} else
inoutvec[i] = invec[i];
}
}
int main(int argc, char **argv)
{
int rank, size, i;
int data;
int errors = 0;
int result = -100;
int correct_result;
MPI_Op op_assoc, op_addem;
MPI_Comm comm = MPI_COMM_WORLD;
MPI_Info info;
MPI_Request req;
MTest_Init(&argc, &argv);
MPI_Op_create((MPI_User_function *) assoc, 0, &op_assoc);
MPI_Op_create((MPI_User_function *) addem, 1, &op_addem);
/* Run this for a variety of communicator sizes */
MPI_Comm_rank(comm, &rank);
MPI_Comm_size(comm, &size);
MPI_Info_create(&info);
data = rank;
correct_result = 0;
for (i = 0; i <= rank; i++)
correct_result += i;
MPI_Scan_init(&data, &result, 1, MPI_INT, MPI_SUM, comm, info, &req);
for (i = 0; i < 10; ++i) {
MPI_Start(&req);
MPI_Wait(&req, MPI_STATUS_IGNORE);
if (result != correct_result) {
fprintf(stderr, "[%d] Error suming ints with scan\n", rank);
errors++;
}
}
MPI_Request_free(&req);
MPI_Scan_init(&data, &result, 1, MPI_INT, MPI_SUM, comm, info, &req);
for (i = 0; i < 10; ++i) {
MPI_Start(&req);
MPI_Wait(&req, MPI_STATUS_IGNORE);
if (result != correct_result) {
fprintf(stderr, "[%d] Error summing ints with scan (2)\n", rank);
errors++;
}
}
MPI_Request_free(&req);
data = rank;
result = -100;
MPI_Scan_init(&data, &result, 1, MPI_INT, op_addem, comm, info, &req);
for (i = 0; i < 10; ++i) {
MPI_Start(&req);
MPI_Wait(&req, MPI_STATUS_IGNORE);
if (result != correct_result) {
fprintf(stderr, "[%d] Error summing ints with scan (userop)\n", rank);
errors++;
}
}
MPI_Request_free(&req);
MPI_Scan_init(&data, &result, 1, MPI_INT, op_addem, comm, info, &req);
for (i = 0; i < 10; ++i) {
MPI_Start(&req);
MPI_Wait(&req, MPI_STATUS_IGNORE);
if (result != correct_result) {
fprintf(stderr, "[%d] Error summing ints with scan (userop2)\n", rank);
errors++;
}
}
MPI_Request_free(&req);
MPI_Scan_init(&data, &result, 1, MPI_INT, op_assoc, comm, info, &req);
for (i = 0; i < 10; ++i) {
result = -100;
data = rank;
MPI_Start(&req);
MPI_Wait(&req, MPI_STATUS_IGNORE);
if (result == BAD_ANSWER) {
fprintf(stderr, "[%d] Error scanning with non-commutative op\n", rank);
errors++;
}
}
MPI_Request_free(&req);
MPI_Info_free(&info);
MPI_Op_free(&op_assoc);
MPI_Op_free(&op_addem);
MTest_Finalize(errors);
return errors;
}
|
