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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include "mpi.h"
#include <stdlib.h>
#include <stdio.h>
#include "mpitest.h"
/* This example sends a vector and receives individual elements */
int main(int argc, char **argv)
{
MPI_Datatype vec;
double *vecin, *vecout, ivalue;
int root, i, n, stride, errs = 0;
int rank, size;
MPI_Info info;
MPI_Request *reqs;
MTest_Init(&argc, &argv);
MPI_Comm_size(MPI_COMM_WORLD, &size);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Info_create(&info);
n = 12;
stride = 10;
vecin = (double *) malloc(n * stride * size * sizeof(double));
vecout = (double *) malloc(n * sizeof(double));
reqs = (MPI_Request *) malloc(size * sizeof(MPI_Request));
MPI_Type_vector(n, 1, stride, MPI_DOUBLE, &vec);
MPI_Type_commit(&vec);
for (i = 0; i < n * stride * size; i++)
vecin[i] = (double) i;
for (root = 0; root < size; root++) {
MPI_Scatter_init(vecin, 1, vec, vecout, n, MPI_DOUBLE, root, MPI_COMM_WORLD, info,
&(reqs[root]));
}
for (root = 0; root < size; root++) {
for (i = 0; i < 10; ++i) {
for (i = 0; i < n; i++)
vecout[i] = -1.0;
MPI_Start(&reqs[root]);
MPI_Wait(&reqs[root], MPI_STATUS_IGNORE);
ivalue = rank * ((n - 1) * stride + 1);
for (i = 0; i < n; i++) {
if (vecout[i] != ivalue) {
printf("Expected %f but found %f\n", ivalue, vecout[i]);
errs++;
}
ivalue += stride;
}
}
MPI_Request_free(&reqs[root]);
}
free(vecin);
free(vecout);
free(reqs);
MPI_Info_free(&info);
MPI_Type_free(&vec);
MTest_Finalize(errs);
return MTestReturnValue(errs);
}
|