-
Notifications
You must be signed in to change notification settings - Fork 4
/
eval.cpp
360 lines (303 loc) · 7.87 KB
/
eval.cpp
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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
/* Routine for evaluating population members */
# include <stdio.h>
# include <stdlib.h>
# include <math.h>
# include <vector>
# include <unistd.h>
# include "rand.h"
# include "problemdef.h"
#ifdef USE_OPENMP
# include <omp.h>
#endif
/* Routine to evaluate objective function values and constraints for a population */
void evaluate_pop (population *pop)
{
#ifdef USE_MPI
{
div_t inds_per_mpi_task;
inds_per_mpi_task = div(popsize,mpiProcessors);
if(inds_per_mpi_task.quot)
{
//#ifdef USE_OPENMP
//#pragma omp parallel for
//#endif
for(int p = 1; p < mpiProcessors; p++)
{
int start = p * inds_per_mpi_task.quot;
mpi_send_inds_to_worker(pop, start, inds_per_mpi_task.quot, p);
}
#ifdef USE_OPENMP
#pragma omp parallel for
#endif
for(int i = 0; i < inds_per_mpi_task.quot + inds_per_mpi_task.rem; i++)
{
if(i < inds_per_mpi_task.quot)
{
evaluate_ind(i, &pop->ind[i]);
}
else
{
int start = (mpiProcessors * inds_per_mpi_task.quot) + (i - inds_per_mpi_task.quot);
evaluate_ind(start, &pop->ind[start]);
}
}
}
if(inds_per_mpi_task.quot)
{
#ifdef USE_OPENMP
#pragma omp parallel for
#endif
for(int p = 1; p < mpiProcessors; p++)
{
mpi_recieve_inds_from_worker(pop, p);
}
}
}
#else
{
#ifdef USE_OPENMP
#pragma omp parallel for
#endif
for (int i = 0; i < popsize; i++)
{
evaluate_ind (i, &(pop->ind[i]));
}
}
#endif
return;
}
/* Routine to evaluate objective function values and constraints for an individual */
void evaluate_ind (int index, individual *ind)
{
int j;
problemDefinition(currentGen, index, nreal, ind->xreal, nbin, ind->xbin, nbits, ind->gene, nobj, ind->obj, ncon, ind->constr, problemOptions);
if (ncon == 0)
{
ind->constr_violation = 0.0;
}
else
{
ind->constr_violation = 0.0;
if(ncon > 0)
{
for (j= 0; j < ncon; j++)
{
if (ind->constr[j] < 0.0)
{
ind->constr_violation += ind->constr[j];
}
}
}
}
return;
}
#ifdef USE_MPI
void mpi_send_inds_to_worker(population *pop, int start, int length, int mpiProcessor)
{
#ifdef USE_MPI
{
std::vector<double> data; data.reserve(length * (nreal + nbin * max_nbits + 1) + 2);
data.push_back(currentGen);
data.push_back(length);
for(int i = start; i < (start + length); i++)
{
data.push_back(i);
individual *ind = &(pop->ind[i]);
mpi_serialize_ind_from_master(ind, data);
}
printf("Sending [%i] => [%i] | No Ind: %i | Data Size: %i\n", procRank, mpiProcessor, length, (int)data.size());
MPI_Send(&data[0] , data.size() , MPI_DOUBLE, mpiProcessor, 0, MPI_COMM_WORLD);
}
#else
{
#ifdef USE_OPENMP
#pragma omp parallel for
#endif
for(int i = start; i < (start + length); i++)
{
individual *ind = &(pop->ind[i]);
evaluate_ind(ind);
}
}
#endif
}
void mpi_serialize_ind_from_master(individual *ind, std::vector<double> &data)
{
if(nreal > 0)
{
for(int i = 0; i < nreal; i++)
{
data.push_back(ind->xreal[i]);
}
}
if(nbin > 0)
{
for(int i = 0 ; i < nbin ; i++)
{
data.push_back(ind->xbin[i]);
for(int j = 0 ; j < nbits[i]; j++)
{
data.push_back(ind->gene[i][j]);
}
}
}
}
void mpi_recieve_inds_from_master(double *values, int size)
{
int currPos = 0;
currentGen = values[currPos]; currPos++;
int numIndividuals = values[currPos]; currPos++;
printf("[%i] => [%i] Recieving | No Ind: %i | Data Size: %i\n", 0 , procRank, numIndividuals, size);
individual *inds = (individual*)malloc(numIndividuals * sizeof(individual));
int *indexes = new int[numIndividuals];
for(int i = 0; i < numIndividuals; i++)
{
allocate_memory_ind(&inds[i]);
indexes[i] = values[currPos]; currPos++;
mpi_desrialize_ind_from_master(&inds[i],values,currPos);
}
#ifdef USE_OPENMP
#pragma omp parallel for
#endif
for(int i = 0; i < numIndividuals; i++)
{
evaluate_ind(indexes[i], &inds[i]);
}
std::vector<double> data; data.reserve(numIndividuals * (nobj + 1 + ncon));
data.push_back(numIndividuals);
for(int i = 0; i < numIndividuals; i++)
{
data.push_back(indexes[i]);
mpi_serialize_ind_from_worker(&inds[i], data);
}
printf("Sending [%i] => [%i] | No Ind: %i | Data Size: %i\n", procRank, 0, numIndividuals, size);
MPI_Send(&data[0],data.size(),MPI_DOUBLE,0,0,MPI_COMM_WORLD);
for(int i = 0; i < numIndividuals; i++)
{
deallocate_memory_ind(&inds[i]);
}
delete[] indexes;
free(inds);
}
void mpi_desrialize_ind_from_master(individual *ind, double *values, int ¤tPos)
{
if(nreal > 0)
{
for(int i = 0; i < nreal; i++)
{
ind->xreal[i] = values[currentPos]; currentPos++;
}
}
if(nbin > 0)
{
for(int i = 0 ; i < nbin ; i++)
{
ind->xbin[i] = values[currentPos]; currentPos++;
for(int j = 0 ; j < nbits[i]; j++)
{
ind->gene[i][j] = values[currentPos]; currentPos++;
}
}
}
}
void mpi_serialize_ind_from_worker(individual *ind, std::vector<double> &data)
{
if(nobj > 0)
{
for(int i = 0; i < nobj; i++)
{
data.push_back(ind->obj[i]);
}
}
if(ncon > 0)
{
for(int i = 0; i < ncon; i++)
{
data.push_back(ind->constr[i]);
}
}
}
void mpi_recieve_inds_from_worker(population *pop, int mpiProcessor)
{
MPI_Status status;
int result = MPI_Probe(mpiProcessor, MPI_ANY_TAG, MPI_COMM_WORLD, &status);
switch (result)
{
case MPI_SUCCESS:
{
int dataSize = 0;
MPI_Get_count(&status,MPI_DOUBLE, &dataSize);
if(dataSize > 0)
{
double* data = new double[dataSize];
result = MPI_Recv(data, dataSize, MPI_DOUBLE, mpiProcessor, MPI_ANY_TAG, MPI_COMM_WORLD, &status);
if(result == MPI_SUCCESS)
{
int indLength = data[0];
int currPos = 1;
printf("[%i] => [%i] Recieving | No Ind: %i | Data Size: %i\n", mpiProcessor, procRank,indLength, dataSize);
for(int i = 0; i < indLength; i++)
{
int index = data[currPos]; currPos++;
mpi_desrialize_ind_from_worker(&pop->ind[index], data,currPos);
}
}
printf("deleting data from worker...\n");
delete[] data;
printf("finished deleting data from worker...\n");
}
}
break;
case MPI_ERR_COMM:
{
printf("Invalid communicator. A common error is to use a null communicator in a call (not even allowed in MPI_Comm_rank).\n");
MPI_Abort(MPI_COMM_WORLD, result);
}
break;
case MPI_ERR_TAG:
{
printf("Invalid tag argument. Tags must be non-negative; tags in a receive (MPI_Recv, MPI_Irecv, MPI_Sendrecv, etc.) may also be MPI_ANY_TAG. The largest tag value is available through the the attribute MPI_TAG_UB.\n");
MPI_Abort(MPI_COMM_WORLD, result);
}
break;
case MPI_ERR_RANK:
{
printf("Invalid source or destination rank. Ranks must be between zero and the size of the communicator minus one; ranks in a receive (MPI_Recv, MPI_Irecv, MPI_Sendrecv, etc.) may also be MPI_ANY_SOURCE.\n");
MPI_Abort(MPI_COMM_WORLD, result);
}
break;
}
}
void mpi_desrialize_ind_from_worker(individual *ind, double *values, int ¤tPos)
{
if(nobj > 0)
{
for(int i = 0; i < nobj; i++)
{
ind->obj[i] = values[currentPos]; currentPos++;
}
}
if(ncon > 0)
{
for(int i = 0; i < ncon; i++)
{
ind->constr[i] = values[currentPos]; currentPos++;
}
}
if (ncon == 0)
{
ind->constr_violation = 0.0;
}
else if(ncon > 0)
{
ind->constr_violation = 0.0;
for (int j = 0; j < ncon; j++)
{
if (ind->constr[j]<0.0)
{
ind->constr_violation += ind->constr[j];
}
}
}
}
#endif