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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include <stdio.h>
#include "mpi.h"
#include "mpitest.h"
#define TABLE_SIZE 2
int main(int argc, char **argv)
{
int rank, size;
double a[TABLE_SIZE];
struct {
double a;
int b;
} in[TABLE_SIZE], out[TABLE_SIZE];
int i;
int errors = 0;
/* Initialize the environment and some variables */
MTest_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &size);
/* Initialize the maxloc data */
for (i = 0; i < TABLE_SIZE; i++)
a[i] = 0;
for (i = rank; i < TABLE_SIZE; i++)
a[i] = (double) rank + 1.0;
/* Copy data to the "in" buffer */
for (i = 0; i < TABLE_SIZE; i++) {
in[i].a = a[i];
in[i].b = rank;
}
/* Reduce it! */
MPI_Reduce(in, out, TABLE_SIZE, MPI_DOUBLE_INT, MPI_MAXLOC, 0, MPI_COMM_WORLD);
MPI_Bcast(out, TABLE_SIZE, MPI_DOUBLE_INT, 0, MPI_COMM_WORLD);
/* Check to see that we got the right answers */
for (i = 0; i < TABLE_SIZE; i++)
if (i % size == rank)
if (out[i].b != rank) {
printf("MAX (ranks[%d] = %d != %d\n", i, out[i].b, rank);
errors++;
}
/* Initialize the minloc data */
for (i = 0; i < TABLE_SIZE; i++)
a[i] = 0;
for (i = rank; i < TABLE_SIZE; i++)
a[i] = -(double) rank - 1.0;
/* Copy data to the "in" buffer */
for (i = 0; i < TABLE_SIZE; i++) {
in[i].a = a[i];
in[i].b = rank;
}
/* Reduce it! */
MPI_Allreduce(in, out, TABLE_SIZE, MPI_DOUBLE_INT, MPI_MINLOC, MPI_COMM_WORLD);
/* Check to see that we got the right answers */
for (i = 0; i < TABLE_SIZE; i++)
if (i % size == rank)
if (out[i].b != rank) {
printf("MIN (ranks[%d] = %d != %d\n", i, out[i].b, rank);
errors++;
}
/* Finish up! */
MTest_Finalize(errors);
return MTestReturnValue(errors);
}
|
