ViewVC Help

View File | Revision Log | Show Annotations | View Changeset | Root Listing

root/OpenMD/trunk/src/math/ParallelRandNumGen.cpp

Comparing trunk/src/math/ParallelRandNumGen.cpp (file contents):
Revision 1241 by gezelter, Fri Apr 25 15:14:47 2008 UTC vs.
Revision 1879 by gezelter, Sun Jun 16 15:15:42 2013 UTC

#	Line 6 | Line 6
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
9	>	* 1. Redistributions of source code must retain the above copyright
10		*    notice, this list of conditions and the following disclaimer.
11		*
12	<	* 3. Redistributions in binary form must reproduce the above copyright
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.
#	Line 37 | Line 28
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, 234107 (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"
#	Line 44 | Line 45
45		#include <mpi.h>
46		#endif
47
48	<	namespace oopse {
48	>	namespace OpenMD {
49
50		int ParallelRandNumGen::nCreatedRNG_ = 0;
51
52		ParallelRandNumGen::ParallelRandNumGen(const uint32& oneSeed) {
53
54	<	const int masterNode = 0;
55	<	int seed = oneSeed;
54	>	unsigned long seed = oneSeed;
55	>
56		#ifdef IS_MPI
57	<	MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
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");
#	Line 64 | Line 67 | namespace oopse {
67
68		int nProcessors;
69		#ifdef IS_MPI
70	<	MPI_Comm_size(MPI_COMM_WORLD, &nProcessors);
71	<	MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
70	>	nProcessors = MPI::COMM_WORLD.Get_size();
71	>	myRank_ = MPI::COMM_WORLD.Get_rank();
72		#else
73		nProcessors = 1;
74		myRank_ = 0;
#	Line 74 | Line 77 | namespace oopse {
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	<	int newSeed = oneSeed + nCreatedRNG_;
80	>	unsigned long newSeed = oneSeed + nCreatedRNG_;
81		mtRand_ = new MTRand(newSeed, nProcessors, myRank_);
82
83		++nCreatedRNG_;
#	Line 82 | Line 85 | namespace oopse {
85
86		ParallelRandNumGen::ParallelRandNumGen() {
87
85	–	std::vector<uint32> bigSeed;
86	–	const int masterNode = 0;
88		int nProcessors;
89		#ifdef IS_MPI
90	<	MPI_Comm_size(MPI_COMM_WORLD, &nProcessors);
91	<	MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
90	>	nProcessors = MPI::COMM_WORLD.Get_size();
91	>	myRank_ = MPI::COMM_WORLD.Get_rank();
92		#else
93		nProcessors = 1;
94		myRank_ = 0;
#	Line 101 | Line 102 | namespace oopse {
102
103		void ParallelRandNumGen::seed( const uint32 oneSeed ) {
104
105	<	const int masterNode = 0;
105	<	int seed = oneSeed;
105	>	unsigned long seed = oneSeed;
106		#ifdef IS_MPI
107	<	MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
107	>	const int masterNode = 0;
108	>	MPI::COMM_WORLD.Bcast(&seed, 1, MPI::UNSIGNED_LONG, masterNode);
109		#endif
110		if (seed != oneSeed) {
111		sprintf(painCave.errMsg,
#	Line 113 | Line 114 | namespace oopse {
114		simError();
115		}
116
117	<	int newSeed = oneSeed +nCreatedRNG_;
117	>	unsigned long newSeed = oneSeed +nCreatedRNG_;
118		mtRand_->seed(newSeed);
119
120		++nCreatedRNG_;
#	Line 122 | Line 123 | namespace oopse {
123		void ParallelRandNumGen::seed() {
124
125		std::vector<uint32> bigSeed;
126	+
127	+	#ifdef IS_MPI
128		int size;
129		const int masterNode = 0;
127	–	#ifdef IS_MPI
130		if (worldRank == masterNode) {
131		#endif
132
133		bigSeed = mtRand_->generateSeeds();
132	–	size = bigSeed.size();
134
135		#ifdef IS_MPI
136	<	MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);
137	<	MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
136	>	size = bigSeed.size();
137	>	MPI::COMM_WORLD.Bcast(&size, 1, MPI::INT, masterNode);
138	>	MPI::COMM_WORLD.Bcast(&bigSeed[0], size, MPI::UNSIGNED_LONG, masterNode);
139		}else {
140	<	MPI_Bcast(&size, 1, MPI_INT, masterNode, MPI_COMM_WORLD);
140	>	MPI::COMM_WORLD.Bcast(&size, 1, MPI::INT, masterNode);
141		bigSeed.resize(size);
142	<	MPI_Bcast(&bigSeed[0], size, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD);
142	>	MPI::COMM_WORLD.Bcast(&bigSeed[0], size, MPI::UNSIGNED_LONG, masterNode);
143		}
144		#endif
145

Comparing trunk/src/math/ParallelRandNumGen.cpp (property svn:keywords):
Revision 1241 by gezelter, Fri Apr 25 15:14:47 2008 UTC vs.
Revision 1879 by gezelter, Sun Jun 16 15:15:42 2013 UTC

#	Line 0 | Line 1
1	+	Author Id Revision Date

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines