src/math/ParallelRandNumGen.cpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Acknowledgement of the program authors must be made in any
 *    publication of scientific results based in part on use of the
 *    program.  An acceptable form of acknowledgement is citation of
 *    the article in which the program was described (Matthew
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
 *    Parallel Simulation Engine for Molecular Dynamics,"
 *    J. Comput. Chem. 26, pp. 252-271 (2005))
 *
 * 2. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 3. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 */

#include "math/ParallelRandNumGen.hpp"
#ifdef IS_MPI
#include <mpi.h>
#endif

namespace oopse {

  int ParallelRandNumGen::nCreatedRNG_ = 0;

  ParallelRandNumGen::ParallelRandNumGen(const uint32& oneSeed) {

    const int masterNode = 0;
    unsigned long seed = oneSeed;

#ifdef IS_MPI
    MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD); 
#endif

    if (seed != oneSeed) {
      sprintf(painCave.errMsg,
              "Using different seed to initialize ParallelRandNumGen.\n");
      painCave.isFatal = 1;;
      simError();
    }

    int nProcessors;
#ifdef IS_MPI
    MPI_Comm_size( MPI_COMM_WORLD, &nProcessors);
    MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
#else
    nProcessors = 1;
    myRank_ = 0;
#endif
    //In order to generate independent random number stream, the
    //actual seed used by random number generator is the seed passed
    //to the constructor plus the number of random number generators
    //which are already created.
    unsigned long newSeed = oneSeed + nCreatedRNG_;
    mtRand_ = new MTRand(newSeed, nProcessors, myRank_);
    
    ++nCreatedRNG_;
  }

  ParallelRandNumGen::ParallelRandNumGen() {

    std::vector<uint32> bigSeed;
    const int masterNode = 0;
    int nProcessors;
#ifdef IS_MPI
    MPI_Comm_size( MPI_COMM_WORLD, &nProcessors);
    MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
#else
    nProcessors = 1;
    myRank_ = 0;
#endif
    mtRand_ = new MTRand(nProcessors, myRank_);

    seed();       /** @todo calling virtual function in constructor is
                      not a good design */
  }


  void ParallelRandNumGen::seed( const uint32 oneSeed ) {

    const int masterNode = 0;
    unsigned long seed = oneSeed;
#ifdef IS_MPI
    MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD); 
#endif
    if (seed != oneSeed) {
      sprintf(painCave.errMsg,
              "Using different seed to initialize ParallelRandNumGen.\n");
      painCave.isFatal = 1;;
      simError();
    }
    
    unsigned long newSeed = oneSeed +nCreatedRNG_;
    mtRand_->seed(newSeed);
    
    ++nCreatedRNG_;
  }
        
  void ParallelRandNumGen::seed() {

    std::vector<uint32> bigSeed;
    int size;
    const int masterNode = 0;
#ifdef IS_MPI
    if (worldRank == masterNode) {
#endif

      bigSeed = mtRand_->generateSeeds();
      size = bigSeed.size();

#ifdef IS_MPI
      MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);        
      MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD); 
    }else {
      MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);        
      bigSeed.resize(size);
      MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD); 
    }
#endif
    
    if (bigSeed.size() == 1) {
      mtRand_->seed(bigSeed[0]);
    } else {
      mtRand_->seed(&bigSeed[0], bigSeed.size());
    }

    ++nCreatedRNG_;
  }        
}
Revision:	1313
Committed:	Wed Oct 22 20:01:49 2008 UTC (16 years, 6 months ago) by gezelter
File size:	4954 byte(s)
Log Message:	General bug-fixes and other changes to make particle pots work with the Helfand Energy correlation function
#	User	Rev	Content
1	gezelter	507	/*
2	tim	388	* 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	gezelter	1241	#endif
46	tim	388
47			namespace oopse {
48
49	gezelter	507	int ParallelRandNumGen::nCreatedRNG_ = 0;
50	tim	388
51	gezelter	1241	ParallelRandNumGen::ParallelRandNumGen(const uint32& oneSeed) {
52	tim	388
53	tim	392	const int masterNode = 0;
54	gezelter	1313	unsigned long seed = oneSeed;
55
56	gezelter	1241	#ifdef IS_MPI
57	tim	392	MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
58	gezelter	1241	#endif
59	gezelter	1313
60	tim	392	if (seed != oneSeed) {
61	gezelter	507	sprintf(painCave.errMsg,
62			"Using different seed to initialize ParallelRandNumGen.\n");
63			painCave.isFatal = 1;;
64			simError();
65	tim	392	}
66
67	tim	388	int nProcessors;
68	gezelter	1241	#ifdef IS_MPI
69	gezelter	1313	MPI_Comm_size( MPI_COMM_WORLD, &nProcessors);
70	tim	398	MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
71	gezelter	1241	#else
72			nProcessors = 1;
73			myRank_ = 0;
74			#endif
75			//In order to generate independent random number stream, the
76			//actual seed used by random number generator is the seed passed
77			//to the constructor plus the number of random number generators
78			//which are already created.
79	gezelter	1313	unsigned long newSeed = oneSeed + nCreatedRNG_;
80	tim	398	mtRand_ = new MTRand(newSeed, nProcessors, myRank_);
81	gezelter	1241
82	tim	388	++nCreatedRNG_;
83	gezelter	507	}
84	tim	388
85	gezelter	507	ParallelRandNumGen::ParallelRandNumGen() {
86	tim	388
87			std::vector<uint32> bigSeed;
88			const int masterNode = 0;
89			int nProcessors;
90	gezelter	1241	#ifdef IS_MPI
91	gezelter	1313	MPI_Comm_size( MPI_COMM_WORLD, &nProcessors);
92	tim	398	MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
93	gezelter	1241	#else
94			nProcessors = 1;
95			myRank_ = 0;
96			#endif
97	tim	398	mtRand_ = new MTRand(nProcessors, myRank_);
98	tim	388
99	gezelter	1241	seed(); /** @todo calling virtual function in constructor is
100			not a good design */
101	gezelter	507	}
102	tim	388
103
104	gezelter	507	void ParallelRandNumGen::seed( const uint32 oneSeed ) {
105	tim	388
106			const int masterNode = 0;
107	gezelter	1313	unsigned long seed = oneSeed;
108	gezelter	1241	#ifdef IS_MPI
109	tim	388	MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
110	gezelter	1241	#endif
111	tim	388	if (seed != oneSeed) {
112	gezelter	507	sprintf(painCave.errMsg,
113			"Using different seed to initialize ParallelRandNumGen.\n");
114			painCave.isFatal = 1;;
115			simError();
116	tim	388	}
117	gezelter	1241
118	gezelter	1313	unsigned long newSeed = oneSeed +nCreatedRNG_;
119	tim	388	mtRand_->seed(newSeed);
120	gezelter	1241
121	tim	388	++nCreatedRNG_;
122	gezelter	507	}
123	tim	388
124	gezelter	507	void ParallelRandNumGen::seed() {
125	tim	388
126			std::vector<uint32> bigSeed;
127			int size;
128			const int masterNode = 0;
129	gezelter	1241	#ifdef IS_MPI
130	tim	388	if (worldRank == masterNode) {
131	gezelter	1241	#endif
132
133	gezelter	507	bigSeed = mtRand_->generateSeeds();
134			size = bigSeed.size();
135	gezelter	1241
136			#ifdef IS_MPI
137	gezelter	507	MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);
138			MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
139	tim	388	}else {
140	gezelter	507	MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);
141			bigSeed.resize(size);
142			MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
143	tim	388	}
144	gezelter	1241	#endif
145	tim	388
146			if (bigSeed.size() == 1) {
147	gezelter	507	mtRand_->seed(bigSeed[0]);
148	tim	388	} else {
149	gezelter	507	mtRand_->seed(&bigSeed[0], bigSeed.size());
150	tim	388	}
151
152			++nCreatedRNG_;
153	gezelter	1241	}
154	tim	388	}