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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
package mpi.group;
/****************************************************************************
MESSAGE PASSING INTERFACE TEST CASE SUITE
Copyright IBM Corp. 1995
IBM Corp. hereby grants a non-exclusive license to use, copy, modify, and
distribute this software for any purpose and without fee provided that the
above copyright notice and the following paragraphs appear in all copies.
IBM Corp. makes no representation that the test cases comprising this
suite are correct or are an accurate representation of any standard.
In no event shall IBM be liable to any party for direct, indirect, special
incidental, or consequential damage arising out of the use of this software
even if IBM Corp. has been advised of the possibility of such damage.
IBM CORP. SPECIFICALLY DISCLAIMS ANY WARRANTIES INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS AND IBM
CORP. HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,
ENHANCEMENTS, OR MODIFICATIONS.
****************************************************************************
These test cases reflect an interpretation of the MPI Standard. They are
are, in most cases, unit tests of specific MPI behaviors. If a user of any
test case from this set believes that the MPI Standard requires behavior
different than that implied by the test case we would appreciate feedback.
Comments may be sent to:
Richard Treumann
treumann@kgn.ibm.com
****************************************************************************
MPI-Java version :
Sung-Hoon Ko(shko@npac.syr.edu)
Northeast Parallel Architectures Center at Syracuse University
03/22/98
****************************************************************************
*/
import mpi.*;
public class group {
static public void main(String[] args) throws Exception {
try {
group a = new group(args);
}
catch (Exception e) {
}
}
public group() {
}
public group(String[] args) throws Exception {
int tasks, me, size, rank, i, result, rc;
int cnt = 0;
MPI.Init(args);
mpi.Group group1, group2, group3, newgroup;
mpi.Group groups[] = new mpi.Group[20];
Comm newcomm;
tasks = MPI.COMM_WORLD.Size();
me = MPI.COMM_WORLD.Rank();
int ranks1[] = new int[tasks / 2];
int ranks2[] = new int[tasks / 2];
int ranks3[] = new int[tasks];
if (tasks != 8) {
if (me == 0)
System.out.println("group->group: MUST HAVE 8 TASKS");
MPI.COMM_WORLD.Barrier();
MPI.Finalize();
return;
}
group1 = MPI.COMM_WORLD.Group();
groups[cnt++] = group1;
size = group1.Size();
if (size != tasks)
System.out.println("ERROR in MPI_Group_size, size = " + size
+ ", should be " + tasks);
rank = group1.Rank();
if (rank != me)
System.out.println("ERROR in MPI_Group_rank, rank = " + rank
+ ", should be " + me);
for (i = 0; i < tasks / 2; i++)
ranks1[i] = i;
newgroup = group1.Incl(ranks1);
/* newgroup freed below */
size = newgroup.Size();
if (size != (tasks / 2))
System.out.println("ERROR in MPI_Group_size, size = " + size
+ ", should be " + (tasks / 2));
result = mpi.Group.Compare(newgroup, newgroup);
if (result != MPI.IDENT)
System.out.println("ERROR in MPI_Group_compare (1), result = " + result
+ ", should be " + MPI.IDENT);
result = mpi.Group.Compare(newgroup, group1);
if (result != MPI.UNEQUAL)
System.out.println("ERROR in MPI_Group_compare (2), result = " + result
+ ", should be " + MPI.UNEQUAL);
group2 = mpi.Group.Union(group1, newgroup);
groups[cnt++] = group2;
result = mpi.Group.Compare(group1, group2);
if (result != MPI.IDENT)
System.out.println("ERROR in MPI_Group_compare (3), result = " + result
+ ", should be " + MPI.IDENT);
group2 = mpi.Group.Intersection(newgroup, group1);
groups[cnt++] = group2;
result = mpi.Group.Compare(group2, newgroup);
if (result != MPI.IDENT)
System.out.println("ERROR in MPI_Group_compare (4), result = " + result
+ ", should be " + MPI.IDENT);
group2 = mpi.Group.Difference(group1, newgroup);
groups[cnt++] = group2;
size = group2.Size();
if (size != (tasks / 2))
System.out.println("ERROR in MPI_Group_size, size = " + size
+ ", should be " + (tasks / 2));
for (i = 0; i < size; i++)
ranks1[i] = i;
ranks2 = mpi.Group.Translate_ranks(group2, ranks1, group1);
for (i = 0; i < size; i++) {
if (ranks2[i] != (tasks / 2 + i))
System.out.println("ERROR in MPI_Group_translate_ranks.");
}
newcomm = MPI.COMM_WORLD.Create(newgroup);
if (newcomm != null) {
group3 = newcomm.Group();
groups[cnt++] = group3;
result = mpi.Group.Compare(group3, newgroup);
if (result != MPI.IDENT)
System.out.println("ERROR in MPI_Group_compare (4.5) , result = "
+ result + ", should be " + MPI.IDENT);
}
group3 = group1.Excl(ranks1);
groups[cnt++] = group3;
result = mpi.Group.Compare(group2, group3);
if (result != MPI.IDENT)
System.out.println("ERROR in MPI_Group_compare (5) , result = " + result
+ ", should be " + MPI.IDENT);
for (i = 0; i < tasks; i++)
ranks3[tasks - 1 - i] = i;
group3 = group1.Incl(ranks3);
groups[cnt++] = group3;
result = mpi.Group.Compare(group1, group3);
if (result != MPI.SIMILAR)
System.out.println("ERROR in MPI_Group_compare (6), result = " + result
+ ", should be " + MPI.SIMILAR);
MPI.COMM_WORLD.Barrier();
if (me == 0)
System.out.println("Group TEST COMPLETE");
MPI.Finalize();
}
}
|
