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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <mpi.h>
#include "mpitest.h"
#define ITER_PER_RANK 25
const int verbose = 0;
int main(int argc, char **argv)
{
int i, rank, nproc;
int errors = 0, all_errors = 0;
int val = 0, one = 1;
int iter;
MPI_Aint *val_ptrs;
MPI_Win dyn_win;
MTest_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &nproc);
iter = ITER_PER_RANK * nproc;
val_ptrs = malloc(nproc * sizeof(MPI_Aint));
MPI_Get_address(&val, &val_ptrs[rank]);
MPI_Allgather(MPI_IN_PLACE, 0, MPI_DATATYPE_NULL, val_ptrs, 1, MPI_AINT, MPI_COMM_WORLD);
MPI_Info info = MPI_INFO_NULL;
#ifdef USE_INFO_COLL_ATTACH
MPI_Info_create(&info);
MPI_Info_set(info, "coll_attach", "true");
#endif
MPI_Win_create_dynamic(info, MPI_COMM_WORLD, &dyn_win);
#ifdef USE_INFO_COLL_ATTACH
MPI_Info_free(&info);
#endif
MPI_Win_attach(dyn_win, &val, sizeof(int));
for (i = 0; i < iter; i++) {
MPI_Win_fence(MPI_MODE_NOPRECEDE, dyn_win);
MPI_Accumulate(&one, 1, MPI_INT, i % nproc, val_ptrs[i % nproc], 1, MPI_INT, MPI_SUM,
dyn_win);
MPI_Win_fence(MPI_MODE_NOSUCCEED, dyn_win);
}
MPI_Barrier(MPI_COMM_WORLD);
/* Read and verify my data */
if (val != iter) {
errors++;
printf("%d -- Got %d, expected %d\n", rank, val, iter);
}
MPI_Win_detach(dyn_win, &val);
MPI_Win_free(&dyn_win);
free(val_ptrs);
MTest_Finalize(errors);
return MTestReturnValue(all_errors);
}
|
