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
|
import mpiunittest as unittest
from mpi4py import MPI
_basic = [
None,
True,
False,
-7,
0,
7,
2**31,
-(2**63) + 1,
2**63 - 1,
-2.17,
0.0,
+1.62,
1 + 2j,
2 - 3j,
"mpi4py",
]
messages = list(_basic)
messages += [
list(_basic),
tuple(_basic),
{f"k{k}": v for k, v in enumerate(_basic)},
]
messages = [*messages, messages]
def create_topo_comms(comm):
size = comm.Get_size()
rank = comm.Get_rank()
# Cartesian
n = int(size**1 / 2.0)
m = int(size**1 / 3.0)
if m * m * m == size:
dims = [m, m, m]
elif n * n == size:
dims = [n, n]
else:
dims = [size]
periods = [True] * len(dims)
yield comm.Create_cart(dims, periods=periods)
# Graph
index, edges = [0], []
for i in range(size):
pos = index[-1]
index.append(pos + 2)
edges.extend(((i - 1) % size, (i + 1) % size))
yield comm.Create_graph(index, edges)
# Dist Graph
sources = [(rank - 2) % size, (rank - 1) % size]
destinations = [(rank + 1) % size, (rank + 2) % size]
yield comm.Create_dist_graph_adjacent(sources, destinations)
def get_neighbors_count(comm):
topo = comm.Get_topology()
if topo == MPI.CART:
ndim = comm.Get_dim()
return 2 * ndim, 2 * ndim
if topo == MPI.GRAPH:
rank = comm.Get_rank()
nneighbors = comm.Get_neighbors_count(rank)
return nneighbors, nneighbors
if topo == MPI.DIST_GRAPH:
indeg, outdeg, _w = comm.Get_dist_neighbors_count()
return indeg, outdeg
return 0, 0
def have_feature():
cartcomm = MPI.COMM_SELF.Create_cart([1], periods=[0])
try:
cartcomm.neighbor_allgather(None)
except NotImplementedError:
return False
else:
return True
finally:
cartcomm.Free()
@unittest.skipIf(not have_feature(), "mpi-neighbor")
class BaseTestCCONghObj:
#
COMM = MPI.COMM_NULL
@unittest.skipMPI("openmpi(<2.2.0)")
def testNeighborAllgather(self):
for comm in create_topo_comms(self.COMM):
rsize, _ssize = get_neighbors_count(comm)
for smess in messages:
rmess = comm.neighbor_allgather(smess)
self.assertEqual(rmess, [smess] * rsize)
comm.Free()
def testNeighborAlltoall(self):
for comm in create_topo_comms(self.COMM):
rsize, ssize = get_neighbors_count(comm)
for smess in messages:
rmess = comm.neighbor_alltoall([smess] * ssize)
self.assertEqual(rmess, [smess] * rsize)
comm.Free()
class TestCCONghObjSelf(BaseTestCCONghObj, unittest.TestCase):
#
COMM = MPI.COMM_SELF
class TestCCONghObjWorld(BaseTestCCONghObj, unittest.TestCase):
#
COMM = MPI.COMM_WORLD
class TestCCONghObjSelfDup(TestCCONghObjSelf):
#
def setUp(self):
self.COMM = MPI.COMM_SELF.Dup()
def tearDown(self):
self.COMM.Free()
class TestCCONghObjWorldDup(TestCCONghObjWorld):
#
def setUp(self):
self.COMM = MPI.COMM_WORLD.Dup()
def tearDown(self):
self.COMM.Free()
name, version = MPI.get_vendor()
if name == "Open MPI":
if version < (1, 8, 4):
_create_topo_comms = create_topo_comms
def create_topo_comms(comm):
for c in _create_topo_comms(comm):
if c.size * 2 < sum(c.degrees):
c.Free()
continue
yield c
if __name__ == "__main__":
unittest.main()
|
