| 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. Acknowledgement of the program authors must be made in any | 
| 10 | 
 *    publication of scientific results based in part on use of the | 
| 11 | 
 *    program.  An acceptable form of acknowledgement is citation of | 
| 12 | 
 *    the article in which the program was described (Matthew | 
| 13 | 
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher | 
| 14 | 
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented | 
| 15 | 
 *    Parallel Simulation Engine for Molecular Dynamics," | 
| 16 | 
 *    J. Comput. Chem. 26, pp. 252-271 (2005)) | 
| 17 | 
 * | 
| 18 | 
 * 2. Redistributions of source code must retain the above copyright | 
| 19 | 
 *    notice, this list of conditions and the following disclaimer. | 
| 20 | 
 * | 
| 21 | 
 * 3. Redistributions in binary form must reproduce the above copyright | 
| 22 | 
 *    notice, this list of conditions and the following disclaimer in the | 
| 23 | 
 *    documentation and/or other materials provided with the | 
| 24 | 
 *    distribution. | 
| 25 | 
 * | 
| 26 | 
 * This software is provided "AS IS," without a warranty of any | 
| 27 | 
 * kind. All express or implied conditions, representations and | 
| 28 | 
 * warranties, including any implied warranty of merchantability, | 
| 29 | 
 * fitness for a particular purpose or non-infringement, are hereby | 
| 30 | 
 * excluded.  The University of Notre Dame and its licensors shall not | 
| 31 | 
 * be liable for any damages suffered by licensee as a result of | 
| 32 | 
 * using, modifying or distributing the software or its | 
| 33 | 
 * derivatives. In no event will the University of Notre Dame or its | 
| 34 | 
 * licensors be liable for any lost revenue, profit or data, or for | 
| 35 | 
 * direct, indirect, special, consequential, incidental or punitive | 
| 36 | 
 * damages, however caused and regardless of the theory of liability, | 
| 37 | 
 * arising out of the use of or inability to use software, even if the | 
| 38 | 
 * University of Notre Dame has been advised of the possibility of | 
| 39 | 
 * such damages. | 
| 40 | 
 */ | 
| 41 | 
 | 
| 42 | 
#include "math/ParallelRandNumGen.hpp" | 
| 43 | 
#ifdef IS_MPI | 
| 44 | 
#include <mpi.h> | 
| 45 | 
 | 
| 46 | 
namespace oopse { | 
| 47 | 
 | 
| 48 | 
 | 
| 49 | 
 | 
| 50 | 
  int ParallelRandNumGen::nCreatedRNG_ = 0; | 
| 51 | 
 | 
| 52 | 
  ParallelRandNumGen::ParallelRandNumGen( const uint32& oneSeed) { | 
| 53 | 
 | 
| 54 | 
    const int masterNode = 0; | 
| 55 | 
    int seed = oneSeed; | 
| 56 | 
    MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);  | 
| 57 | 
 | 
| 58 | 
    if (seed != oneSeed) { | 
| 59 | 
      sprintf(painCave.errMsg, | 
| 60 | 
              "Using different seed to initialize ParallelRandNumGen.\n"); | 
| 61 | 
      painCave.isFatal = 1;; | 
| 62 | 
      simError(); | 
| 63 | 
    } | 
| 64 | 
 | 
| 65 | 
    int nProcessors; | 
| 66 | 
    MPI_Comm_size(MPI_COMM_WORLD, &nProcessors); | 
| 67 | 
    MPI_Comm_rank( MPI_COMM_WORLD, &myRank_); | 
| 68 | 
    //In order to generate independent random number stream, the actual seed used by random  | 
| 69 | 
    //number generator is the seed passed to the constructor plus the number of random number | 
| 70 | 
    //generators which are already created.      | 
| 71 | 
    int newSeed = oneSeed + nCreatedRNG_; | 
| 72 | 
    mtRand_ = new MTRand(newSeed, nProcessors, myRank_); | 
| 73 | 
 | 
| 74 | 
    ++nCreatedRNG_; | 
| 75 | 
  } | 
| 76 | 
 | 
| 77 | 
  ParallelRandNumGen::ParallelRandNumGen() { | 
| 78 | 
 | 
| 79 | 
    std::vector<uint32> bigSeed; | 
| 80 | 
    const int masterNode = 0; | 
| 81 | 
    int nProcessors; | 
| 82 | 
    MPI_Comm_size(MPI_COMM_WORLD, &nProcessors); | 
| 83 | 
    MPI_Comm_rank( MPI_COMM_WORLD, &myRank_); | 
| 84 | 
    mtRand_ = new MTRand(nProcessors, myRank_); | 
| 85 | 
 | 
| 86 | 
    seed();       /** @todo calling virtual function in constructor is not a good design */ | 
| 87 | 
  } | 
| 88 | 
 | 
| 89 | 
 | 
| 90 | 
  void ParallelRandNumGen::seed( const uint32 oneSeed ) { | 
| 91 | 
 | 
| 92 | 
    const int masterNode = 0; | 
| 93 | 
    int seed = oneSeed; | 
| 94 | 
    MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);  | 
| 95 | 
 | 
| 96 | 
    if (seed != oneSeed) { | 
| 97 | 
      sprintf(painCave.errMsg, | 
| 98 | 
              "Using different seed to initialize ParallelRandNumGen.\n"); | 
| 99 | 
      painCave.isFatal = 1;; | 
| 100 | 
      simError(); | 
| 101 | 
    } | 
| 102 | 
 | 
| 103 | 
    int newSeed = oneSeed +nCreatedRNG_; | 
| 104 | 
    mtRand_->seed(newSeed); | 
| 105 | 
 | 
| 106 | 
    ++nCreatedRNG_; | 
| 107 | 
  } | 
| 108 | 
         | 
| 109 | 
  void ParallelRandNumGen::seed() { | 
| 110 | 
 | 
| 111 | 
    std::vector<uint32> bigSeed; | 
| 112 | 
    int size; | 
| 113 | 
    const int masterNode = 0; | 
| 114 | 
    if (worldRank == masterNode) { | 
| 115 | 
      bigSeed = mtRand_->generateSeeds(); | 
| 116 | 
      size = bigSeed.size(); | 
| 117 | 
      MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);         | 
| 118 | 
      MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);  | 
| 119 | 
 | 
| 120 | 
    }else { | 
| 121 | 
      MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);         | 
| 122 | 
      bigSeed.resize(size); | 
| 123 | 
      MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);  | 
| 124 | 
    } | 
| 125 | 
     | 
| 126 | 
    if (bigSeed.size() == 1) { | 
| 127 | 
      mtRand_->seed(bigSeed[0]); | 
| 128 | 
    } else { | 
| 129 | 
      mtRand_->seed(&bigSeed[0], bigSeed.size()); | 
| 130 | 
    } | 
| 131 | 
 | 
| 132 | 
    ++nCreatedRNG_; | 
| 133 | 
  }     | 
| 134 | 
 | 
| 135 | 
 | 
| 136 | 
} | 
| 137 | 
 | 
| 138 | 
#endif  |