| 1 |
/* |
| 2 |
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
| 3 |
* |
| 4 |
* The University of Notre Dame grants you ("Licensee") a |
| 5 |
* non-exclusive, royalty free, license to use, modify and |
| 6 |
* redistribute this software in source and binary code form, provided |
| 7 |
* that the following conditions are met: |
| 8 |
* |
| 9 |
* 1. Redistributions of source code must retain the above copyright |
| 10 |
* notice, this list of conditions and the following disclaimer. |
| 11 |
* |
| 12 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 13 |
* notice, this list of conditions and the following disclaimer in the |
| 14 |
* documentation and/or other materials provided with the |
| 15 |
* distribution. |
| 16 |
* |
| 17 |
* This software is provided "AS IS," without a warranty of any |
| 18 |
* kind. All express or implied conditions, representations and |
| 19 |
* warranties, including any implied warranty of merchantability, |
| 20 |
* fitness for a particular purpose or non-infringement, are hereby |
| 21 |
* excluded. The University of Notre Dame and its licensors shall not |
| 22 |
* be liable for any damages suffered by licensee as a result of |
| 23 |
* using, modifying or distributing the software or its |
| 24 |
* derivatives. In no event will the University of Notre Dame or its |
| 25 |
* licensors be liable for any lost revenue, profit or data, or for |
| 26 |
* direct, indirect, special, consequential, incidental or punitive |
| 27 |
* damages, however caused and regardless of the theory of liability, |
| 28 |
* arising out of the use of or inability to use software, even if the |
| 29 |
* University of Notre Dame has been advised of the possibility of |
| 30 |
* such damages. |
| 31 |
* |
| 32 |
* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your |
| 33 |
* research, please cite the appropriate papers when you publish your |
| 34 |
* work. Good starting points are: |
| 35 |
* |
| 36 |
* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). |
| 37 |
* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). |
| 38 |
* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008). |
| 39 |
* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). |
| 40 |
* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). |
| 41 |
*/ |
| 42 |
|
| 43 |
#include "math/ParallelRandNumGen.hpp" |
| 44 |
#ifdef IS_MPI |
| 45 |
#include <mpi.h> |
| 46 |
#endif |
| 47 |
|
| 48 |
namespace OpenMD { |
| 49 |
|
| 50 |
int ParallelRandNumGen::nCreatedRNG_ = 0; |
| 51 |
|
| 52 |
ParallelRandNumGen::ParallelRandNumGen(const uint32& oneSeed) { |
| 53 |
|
| 54 |
unsigned long seed = oneSeed; |
| 55 |
|
| 56 |
#ifdef IS_MPI |
| 57 |
const int masterNode = 0; |
| 58 |
MPI::COMM_WORLD.Bcast(&seed, 1, MPI::UNSIGNED_LONG, masterNode); |
| 59 |
#endif |
| 60 |
|
| 61 |
if (seed != oneSeed) { |
| 62 |
sprintf(painCave.errMsg, |
| 63 |
"Using different seed to initialize ParallelRandNumGen.\n"); |
| 64 |
painCave.isFatal = 1;; |
| 65 |
simError(); |
| 66 |
} |
| 67 |
|
| 68 |
int nProcessors; |
| 69 |
#ifdef IS_MPI |
| 70 |
nProcessors = MPI::COMM_WORLD.Get_size(); |
| 71 |
myRank_ = MPI::COMM_WORLD.Get_rank(); |
| 72 |
#else |
| 73 |
nProcessors = 1; |
| 74 |
myRank_ = 0; |
| 75 |
#endif |
| 76 |
//In order to generate independent random number stream, the |
| 77 |
//actual seed used by random number generator is the seed passed |
| 78 |
//to the constructor plus the number of random number generators |
| 79 |
//which are already created. |
| 80 |
unsigned long newSeed = oneSeed + nCreatedRNG_; |
| 81 |
mtRand_ = new MTRand(newSeed, nProcessors, myRank_); |
| 82 |
|
| 83 |
++nCreatedRNG_; |
| 84 |
} |
| 85 |
|
| 86 |
ParallelRandNumGen::ParallelRandNumGen() { |
| 87 |
|
| 88 |
std::vector<uint32> bigSeed; |
| 89 |
int nProcessors; |
| 90 |
#ifdef IS_MPI |
| 91 |
nProcessors = MPI::COMM_WORLD.Get_size(); |
| 92 |
myRank_ = MPI::COMM_WORLD.Get_rank(); |
| 93 |
#else |
| 94 |
nProcessors = 1; |
| 95 |
myRank_ = 0; |
| 96 |
#endif |
| 97 |
mtRand_ = new MTRand(nProcessors, myRank_); |
| 98 |
|
| 99 |
seed(); /** @todo calling virtual function in constructor is |
| 100 |
not a good design */ |
| 101 |
} |
| 102 |
|
| 103 |
|
| 104 |
void ParallelRandNumGen::seed( const uint32 oneSeed ) { |
| 105 |
|
| 106 |
unsigned long seed = oneSeed; |
| 107 |
#ifdef IS_MPI |
| 108 |
const int masterNode = 0; |
| 109 |
MPI::COMM_WORLD.Bcast(&seed, 1, MPI::UNSIGNED_LONG, masterNode); |
| 110 |
#endif |
| 111 |
if (seed != oneSeed) { |
| 112 |
sprintf(painCave.errMsg, |
| 113 |
"Using different seed to initialize ParallelRandNumGen.\n"); |
| 114 |
painCave.isFatal = 1;; |
| 115 |
simError(); |
| 116 |
} |
| 117 |
|
| 118 |
unsigned long newSeed = oneSeed +nCreatedRNG_; |
| 119 |
mtRand_->seed(newSeed); |
| 120 |
|
| 121 |
++nCreatedRNG_; |
| 122 |
} |
| 123 |
|
| 124 |
void ParallelRandNumGen::seed() { |
| 125 |
|
| 126 |
std::vector<uint32> bigSeed; |
| 127 |
|
| 128 |
#ifdef IS_MPI |
| 129 |
int size; |
| 130 |
const int masterNode = 0; |
| 131 |
if (worldRank == masterNode) { |
| 132 |
#endif |
| 133 |
|
| 134 |
bigSeed = mtRand_->generateSeeds(); |
| 135 |
|
| 136 |
#ifdef IS_MPI |
| 137 |
size = bigSeed.size(); |
| 138 |
MPI::COMM_WORLD.Bcast(&size, 1, MPI::INT, masterNode); |
| 139 |
MPI::COMM_WORLD.Bcast(&bigSeed[0], size, MPI::UNSIGNED_LONG, masterNode); |
| 140 |
}else { |
| 141 |
MPI::COMM_WORLD.Bcast(&size, 1, MPI::INT, masterNode); |
| 142 |
bigSeed.resize(size); |
| 143 |
MPI::COMM_WORLD.Bcast(&bigSeed[0], size, MPI::UNSIGNED_LONG, masterNode); |
| 144 |
} |
| 145 |
#endif |
| 146 |
|
| 147 |
if (bigSeed.size() == 1) { |
| 148 |
mtRand_->seed(bigSeed[0]); |
| 149 |
} else { |
| 150 |
mtRand_->seed(&bigSeed[0], bigSeed.size()); |
| 151 |
} |
| 152 |
|
| 153 |
++nCreatedRNG_; |
| 154 |
} |
| 155 |
} |
