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
|
#include <cassert>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <mpi.h>
#include "cctk.h"
#include "functions.hh"
namespace Carpet
{
using namespace std;
vector <string> models; // Model id to model name
std::map <string, int> model_map; // Model name to model id
vector <int> model_ids; // Processor to model id
vector <vector <int> > model_procs; // Model id to processors
vector <string> Models () { return models; }
std::map <string, int> ModelMap () { return model_map; }
vector <int> ModelIds () { return model_ids; }
vector <vector <int> > ModelProcs () { return model_procs; }
string Models (int const id)
{
return models.at (id);
}
int ModelMap (string const name)
{
if (model_map.find (name) != model_map.end())
{
return model_map[name];
}
else
{
return -1;
}
}
int ModelId (int const proc)
{
return model_ids.at (proc);
}
vector <int> ModelProcs (int const proc)
{
return model_procs.at (proc);
}
void
SplitUniverse (MPI_Comm const world, string const model, MPI_Comm & comm,
bool const verbose)
{
// Get the total number of processors
int num_procs;
MPI_Comm_size (world, & num_procs);
int my_proc;
MPI_Comm_rank (world, & my_proc);
// Gather all model names
models = AllGatherString (world, model);
// Map model strings to small integers
int num_models = 0;
model_ids.resize (num_procs);
model_map.clear ();
for (int n = 0; n < num_procs; ++ n)
{
if (model_map.find (models.at(n)) != model_map.end())
{
model_ids.at(n) = model_map[models.at(n)];
}
else
{
model_map[models.at(n)] = num_models;
model_ids.at(n) = num_models;
++ num_models;
}
}
// Determine processors per model
vector <int> num_model_procs (num_models, 0);
for (int n = 0; n < num_procs; ++ n)
{
++ num_model_procs.at (model_ids.at(n));
}
model_procs.resize (num_models);
for (int m = 0; m < num_models; ++ m)
{
model_procs.at(m).reserve (num_model_procs.at(m));
}
for (int n = 0; n < num_procs; ++ n)
{
model_procs.at (model_ids.at(n)).push_back (n);
}
for (int m = 0; m < num_models; ++ m)
{
assert (static_cast<int> (model_procs.at(m).size())
== num_model_procs.at(m));
}
// Create a new communicator for each model
MPI_Comm_split (world, model_ids.at(my_proc), my_proc, & comm);
if (verbose)
{
CCTK_INFO ("Multi-Model listing:");
for (int m = 0; m < num_models; ++ m)
{
cout << " model " << m << ": \"" << models.at(m) << "\"" << endl;
}
CCTK_INFO ("Multi-Model processor distribution:");
for (int n = 0; n < num_procs; ++ n)
{
int const m = model_ids.at(n);
bool const same_model_as_prev =
n-1 >= 0 and model_ids.at(n-1) == m;
bool const same_model_as_next =
n+1 < num_procs and model_ids.at(n+1) == m;
if (same_model_as_next) {
if (same_model_as_prev) {
// Output nothing
} else {
// This processor has the same model as the next one:
// output only a partial line
cout << " processors " << n << "-";
}
} else {
if (same_model_as_prev) {
// This processor has the same model as the previous one:
// finish a partial line
cout << n << ": "
<< "model " << m << " \"" << models.at(m) << "\"" << endl;
} else {
cout << " processor " << n << ": "
<< "model " << m << " \"" << models.at(m) << "\"" << endl;
}
}
}
int const my_model = model_ids.at(my_proc);
CCTK_VInfo (CCTK_THORNSTRING,
"Multi-Model: This is processor %d, model %d \"%s\"",
my_proc, my_model, model.c_str());
}
}
} // namespace Carpet
|
