4 |
|
#include <cstring> |
5 |
|
#include <cmath> |
6 |
|
#include <mpi.h> |
7 |
– |
#include <mpi++.h> |
7 |
|
|
8 |
|
#include "mpiSimulation.hpp" |
9 |
|
#include "simError.h" |
19 |
|
entryPlug = the_entryPlug; |
20 |
|
mpiPlug = new mpiSimData; |
21 |
|
|
22 |
< |
mpiPlug->numberProcessors = MPI::COMM_WORLD.Get_size(); |
22 |
> |
MPI_Comm_size(MPI_COMM_WORLD, &(mpiPlug->numberProcessors) ); |
23 |
|
mpiPlug->myNode = worldRank; |
24 |
|
|
25 |
|
MolToProcMap = new int[entryPlug->n_mol]; |
66 |
|
int nmol_global, natoms_global; |
67 |
|
int local_index, index; |
68 |
|
int smallDiff, bigDiff; |
69 |
< |
int baseSeed = BASE_SEED; |
69 |
> |
int baseSeed = entryPlug->getSeed(); |
70 |
|
|
71 |
|
int testSum; |
72 |
|
|
82 |
|
mpiPlug->nSRIGlobal = entryPlug->n_SRI; |
83 |
|
mpiPlug->nMolGlobal = entryPlug->n_mol; |
84 |
|
|
85 |
+ |
|
86 |
|
myRandom = new randomSPRNG( baseSeed ); |
87 |
|
|
88 |
< |
a = (double)mpiPlug->nMolGlobal / (double)mpiPlug->nAtomsGlobal; |
88 |
> |
a = 3.0 * (double)mpiPlug->nMolGlobal / (double)mpiPlug->nAtomsGlobal; |
89 |
|
|
90 |
|
// Initialize things that we'll send out later: |
91 |
|
for (i = 0; i < mpiPlug->numberProcessors; i++ ) { |
136 |
|
add_atoms = compStamps[MolComponentType[i]]->getNAtoms(); |
137 |
|
new_atoms = old_atoms + add_atoms; |
138 |
|
|
139 |
– |
// If the processor already had too many atoms, just skip this |
140 |
– |
// processor and try again. |
141 |
– |
|
139 |
|
// If we've been through this loop too many times, we need |
140 |
|
// to just give up and assign the molecule to this processor |
141 |
|
// and be done with it. |
158 |
|
done = 1; |
159 |
|
continue; |
160 |
|
} |
164 |
– |
|
165 |
– |
if (old_atoms >= nTarget) continue; |
161 |
|
|
162 |
|
// If we can add this molecule to this processor without sending |
163 |
|
// it above nTarget, then go ahead and do it: |
174 |
|
} |
175 |
|
|
176 |
|
|
177 |
< |
// The only situation left is where old_atoms < nTarget, but |
178 |
< |
// new_atoms > nTarget. We want to accept this with some |
179 |
< |
// probability that dies off the farther we are from nTarget |
177 |
> |
// The only situation left is when new_atoms > nTarget. We |
178 |
> |
// want to accept this with some probability that dies off the |
179 |
> |
// farther we are from nTarget |
180 |
|
|
181 |
|
// roughly: x = new_atoms - nTarget |
182 |
|
// Pacc(x) = exp(- a * x) |
183 |
< |
// where a = 1 / (average atoms per molecule) |
183 |
> |
// where a = penalty / (average atoms per molecule) |
184 |
|
|
185 |
|
x = (double) (new_atoms - nTarget); |
186 |
|
y = myRandom->getRandom(); |
187 |
< |
|
188 |
< |
if (exp(- a * x) > y) { |
187 |
> |
|
188 |
> |
if (y < exp(- a * x)) { |
189 |
|
MolToProcMap[i] = which_proc; |
190 |
|
AtomsPerProc[which_proc] += add_atoms; |
191 |
|
for (j = 0 ; j < add_atoms; j++ ) { |
203 |
|
|
204 |
|
// Spray out this nonsense to all other processors: |
205 |
|
|
206 |
< |
MPI::COMM_WORLD.Bcast(MolToProcMap, mpiPlug->nMolGlobal, |
207 |
< |
MPI_INT, 0); |
206 |
> |
MPI_Bcast(MolToProcMap, mpiPlug->nMolGlobal, |
207 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
208 |
|
|
209 |
< |
MPI::COMM_WORLD.Bcast(AtomToProcMap, mpiPlug->nAtomsGlobal, |
210 |
< |
MPI_INT, 0); |
209 |
> |
MPI_Bcast(AtomToProcMap, mpiPlug->nAtomsGlobal, |
210 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
211 |
|
|
212 |
< |
MPI::COMM_WORLD.Bcast(MolComponentType, mpiPlug->nMolGlobal, |
213 |
< |
MPI_INT, 0); |
212 |
> |
MPI_Bcast(MolComponentType, mpiPlug->nMolGlobal, |
213 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
214 |
|
|
215 |
< |
MPI::COMM_WORLD.Bcast(AtomsPerProc, mpiPlug->numberProcessors, |
216 |
< |
MPI_INT, 0); |
215 |
> |
MPI_Bcast(AtomsPerProc, mpiPlug->numberProcessors, |
216 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
217 |
|
} else { |
218 |
|
|
219 |
|
// Listen to your marching orders from processor 0: |
220 |
|
|
221 |
< |
MPI::COMM_WORLD.Bcast(MolToProcMap, mpiPlug->nMolGlobal, |
222 |
< |
MPI_INT, 0); |
221 |
> |
MPI_Bcast(MolToProcMap, mpiPlug->nMolGlobal, |
222 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
223 |
|
|
224 |
< |
MPI::COMM_WORLD.Bcast(AtomToProcMap, mpiPlug->nAtomsGlobal, |
225 |
< |
MPI_INT, 0); |
224 |
> |
MPI_Bcast(AtomToProcMap, mpiPlug->nAtomsGlobal, |
225 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
226 |
|
|
227 |
< |
MPI::COMM_WORLD.Bcast(MolComponentType, mpiPlug->nMolGlobal, |
228 |
< |
MPI_INT, 0); |
227 |
> |
MPI_Bcast(MolComponentType, mpiPlug->nMolGlobal, |
228 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
229 |
|
|
230 |
< |
MPI::COMM_WORLD.Bcast(AtomsPerProc, mpiPlug->numberProcessors, |
231 |
< |
MPI_INT, 0); |
230 |
> |
MPI_Bcast(AtomsPerProc, mpiPlug->numberProcessors, |
231 |
> |
MPI_INT, 0, MPI_COMM_WORLD); |
232 |
|
|
233 |
|
|
234 |
|
} |
250 |
|
} |
251 |
|
} |
252 |
|
|
253 |
< |
std::cerr << "proc = " << mpiPlug->myNode << " atoms = " << natoms_local << "\n"; |
254 |
< |
|
255 |
< |
MPI::COMM_WORLD.Allreduce(&nmol_local,&nmol_global,1,MPI_INT,MPI_SUM); |
256 |
< |
MPI::COMM_WORLD.Allreduce(&natoms_local,&natoms_global,1,MPI_INT,MPI_SUM); |
253 |
> |
MPI_Allreduce(&nmol_local,&nmol_global,1,MPI_INT,MPI_SUM, |
254 |
> |
MPI_COMM_WORLD); |
255 |
> |
MPI_Allreduce(&natoms_local,&natoms_global,1,MPI_INT, |
256 |
> |
MPI_SUM, MPI_COMM_WORLD); |
257 |
|
|
258 |
|
if( nmol_global != entryPlug->n_mol ){ |
259 |
|
sprintf( painCave.errMsg, |
298 |
|
int isError, i; |
299 |
|
int *globalIndex = new int[mpiPlug->myNlocal]; |
300 |
|
|
301 |
< |
for(i=0; i<mpiPlug->myNlocal; i++) globalIndex[i] = entryPlug->atoms[i]->getGlobalIndex(); |
301 |
> |
// Fortran indexing needs to be increased by 1 in order to get the 2 languages to |
302 |
> |
// not barf |
303 |
|
|
304 |
+ |
for(i=0; i<mpiPlug->myNlocal; i++) globalIndex[i] = entryPlug->atoms[i]->getGlobalIndex()+1; |
305 |
+ |
|
306 |
|
|
307 |
|
isError = 0; |
308 |
|
setFsimParallel( mpiPlug, &(entryPlug->n_atoms), globalIndex, &isError ); |