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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include "mpi.h"
#include "stdio.h"
#include "mpitest.h"
#include "squelch.h"
/* tests a series of puts, gets, and accumulate on 2 processes using fence */
#define SIZE 100
int main(int argc, char *argv[])
{
int rank, nprocs, A[SIZE], B[SIZE], i;
MPI_Comm CommDeuce;
MPI_Win win;
int errs = 0;
MTest_Init(&argc, &argv);
MPI_Comm_size(MPI_COMM_WORLD, &nprocs);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
if (nprocs < 2) {
printf("Run this program with 2 or more processes\n");
MPI_Abort(MPI_COMM_WORLD, 1);
}
MPI_Comm_split(MPI_COMM_WORLD, (rank < 2), rank, &CommDeuce);
if (rank < 2) {
if (rank == 0) {
for (i = 0; i < SIZE; i++)
A[i] = B[i] = i;
} else {
for (i = 0; i < SIZE; i++) {
A[i] = (-3) * i;
B[i] = (-4) * i;
}
}
MPI_Win_create(B, SIZE * sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &win);
MPI_Win_fence(0, win);
if (rank == 0) {
for (i = 0; i < SIZE - 1; i++)
MPI_Put(A + i, 1, MPI_INT, 1, i, 1, MPI_INT, win);
} else {
for (i = 0; i < SIZE - 1; i++)
MPI_Get(A + i, 1, MPI_INT, 0, i, 1, MPI_INT, win);
MPI_Accumulate(A + i, 1, MPI_INT, 0, i, 1, MPI_INT, MPI_SUM, win);
}
MPI_Win_fence(0, win);
if (rank == 1) {
for (i = 0; i < SIZE - 1; i++) {
if (A[i] != B[i]) {
SQUELCH(printf("Put/Get Error: A[i]=%d, B[i]=%d\n", A[i], B[i]););
errs++;
}
}
} else {
if (B[SIZE - 1] != SIZE - 1 - 3 * (SIZE - 1)) {
SQUELCH(printf
("Accumulate Error: B[SIZE-1] is %d, should be %d\n", B[SIZE - 1],
SIZE - 1 - 3 * (SIZE - 1)););
errs++;
}
}
MPI_Win_free(&win);
}
MPI_Comm_free(&CommDeuce);
MTest_Finalize(errs);
return MTestReturnValue(errs);
}
|
