#include <mpi.h>
#include "mpitest.h"
-#define ITER 100
+#define ITER_PER_RANK 25
const int verbose = 0;
int i, j, rank, nproc;
int errors = 0, all_errors = 0;
int val = 0, one = 1;
+ int iter;
MPI_Aint *val_ptrs;
MPI_Win dyn_win;
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_COMM_WORLD);
MPI_Win_create_dynamic(MPI_INFO_NULL, MPI_COMM_WORLD, &dyn_win);
- MPI_Win_attach(dyn_win, &one, sizeof(int));
+ MPI_Win_attach(dyn_win, &val, sizeof(int));
- for (i = 0; i < ITER; i++) {
+ 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 ) {
+ if ( val != iter ) {
errors++;
- printf("%d -- Got %d, expected %d\n", rank, val, ITER);
+ printf("%d -- Got %d, expected %d\n", rank, val, iter);
}
- MPI_Win_detach(dyn_win, &one);
+ MPI_Win_detach(dyn_win, &val);
MPI_Win_free(&dyn_win);
MPI_Reduce(&errors, &all_errors, 1, MPI_INT, MPI_SUM, 0, MPI_COMM_WORLD);