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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include <stdio.h>
#include "mpi.h"
#include "mpitest.h"
#define BLKLEN (1024)
#define NUM_BLKS (64)
double large_buf[(BLKLEN + 1) * NUM_BLKS];
double large_buf1[(BLKLEN + 1) * NUM_BLKS];
int main(int argc, char *argv[])
{
int errs = 0, nranks, rank, i, j, r = 0;
MTest_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &nranks);
if (nranks != 3)
MPI_Abort(MPI_COMM_WORLD, 1);
MPI_Request reqs[2];
if (rank == 0) {
MPI_Datatype type;
MPI_Type_create_hvector(NUM_BLKS, BLKLEN, (BLKLEN + 1) * sizeof(double), MPI_DOUBLE, &type);
MPI_Type_commit(&type);
MPI_Irecv(large_buf, 1, type, r + 1, 111, MPI_COMM_WORLD, &reqs[r]);
MPI_Irecv(large_buf1, 1, type, r + 2, 111, MPI_COMM_WORLD, &reqs[r + 1]);
MPI_Type_free(&type);
MPI_Waitall(nranks - 1, reqs, MPI_STATUSES_IGNORE);
for (i = 0; i < (BLKLEN * NUM_BLKS); i += 1025) {
for (j = i; j < i + 1024; j++) {
if (large_buf[j] != rank + 1)
++errs;
if (large_buf1[j] != rank + 2)
++errs;
}
}
} else {
for (i = 0; i < (BLKLEN * NUM_BLKS); i++)
large_buf[i] = rank;
MPI_Send(large_buf, BLKLEN * NUM_BLKS, MPI_DOUBLE, 0, 111, MPI_COMM_WORLD);
}
MTest_Finalize(errs);
return 0;
}
|
