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
79
80
81
82
83
84
85
|
package mpi.ccl;
/*
MPI-Java version :
Sang Lim (slim@npac.syr.edu)
Northeast Parallel Architectures Center at Syracuse University
12/1/98
*/
import mpi.*;
public class allgatherv {
static public void main(String[] args) throws Exception {
try {
allgatherv a = new allgatherv(args);
}
catch (Exception e) {
}
}
public allgatherv() {
}
public allgatherv(String[] args) throws Exception {
final int MAXLEN = 10;
int root, i, j, k;
int myself, tasks, stride = 15;
MPI.Init(args);
myself = MPI.COMM_WORLD.Rank();
tasks = MPI.COMM_WORLD.Size();
if (tasks > 8) {
if (myself == 0) {
System.out.println("allgatherv must run with less than 8 tasks! ");
}
MPI.Finalize();
return;
}
int out[] = new int[MAXLEN];
int in[] = new int[MAXLEN * stride * tasks];
int dis[] = new int[MAXLEN];
int rcount[] = new int[MAXLEN];
int ans[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0 };
for (i = 0; i < MAXLEN; i++) {
dis[i] = i * stride;
rcount[i] = 5;
out[i] = i;
}
rcount[0] = 10;
for (i = 0; i < MAXLEN * tasks * stride; i++) {
in[i] = 0;
}
if (myself == 0)
MPI.COMM_WORLD.Allgatherv(out, 0, 10, MPI.INT, in, 0, rcount, dis,
MPI.INT);
else
MPI.COMM_WORLD
.Allgatherv(out, 0, 5, MPI.INT, in, 0, rcount, dis, MPI.INT);
for (i = 0; i < tasks * stride; i++)
if (ans[i] != in[i])
System.out.println("recived data : " + in[i] + "at [" + i
+ "] should be : " + ans[i] + " on proc. : " + myself);
MPI.COMM_WORLD.Barrier();
if (myself == 0) {
System.out.println("test condition for allgatherv is disabled coz\n"
+ "it throws out of bound exception when total\n"
+ "processes are more than 3 (TBFixed) ");
System.out.println("Allgatherv TEST COMPLETE");
}
MPI.Finalize();
}
}
|
