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>

namespace oopse {


  int ParallelRandNumGen::nCreatedRNG_ = 0;

  ParallelRandNumGen::ParallelRandNumGen( const uint32& oneSeed) {

    const int masterNode = 0;
    int seed = oneSeed;
    MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD); 

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

    int nProcessors;
    MPI_Comm_size(MPI_COMM_WORLD, &nProcessors);
    MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
    //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.     
    int newSeed = oneSeed + nCreatedRNG_;
    mtRand_ = new MTRand(newSeed, nProcessors, myRank_);

    ++nCreatedRNG_;
  }

  ParallelRandNumGen::ParallelRandNumGen() {

    std::vector<uint32> bigSeed;
    const int masterNode = 0;
    int nProcessors;
    MPI_Comm_size(MPI_COMM_WORLD, &nProcessors);
    MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
    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;
    int seed = oneSeed;
    MPI_Bcast(&seed, 1, MPI_UNSIGNED_LONG, masterNode, MPI_COMM_WORLD); 

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

    int newSeed = oneSeed +nCreatedRNG_;
    mtRand_->seed(newSeed);

    ++nCreatedRNG_;
  }
        
  void ParallelRandNumGen::seed() {

    std::vector<uint32> bigSeed;
    int size;
    const int masterNode = 0;
    if (worldRank == masterNode) {
      bigSeed = mtRand_->generateSeeds();
      size = bigSeed.size();
      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); 
    }
    
    if (bigSeed.size() == 1) {
      mtRand_->seed(bigSeed[0]);
    } else {
      mtRand_->seed(&bigSeed[0], bigSeed.size());
    }

    ++nCreatedRNG_;
  }    


}

#endif 
Revision:	2204
Committed:	Fri Apr 15 22:04:00 2005 UTC (19 years, 2 months ago) by gezelter
File size:	4666 byte(s)
Log Message:	xemacs has been drafted to perform our indentation services
#	User	Rev	Content
1	gezelter	2204	/*
2	tim	2072	* 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	gezelter	2204	int ParallelRandNumGen::nCreatedRNG_ = 0;
51	tim	2072
52	gezelter	2204	ParallelRandNumGen::ParallelRandNumGen( const uint32& oneSeed) {
53	tim	2072
54	tim	2076	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	gezelter	2204	sprintf(painCave.errMsg,
60			"Using different seed to initialize ParallelRandNumGen.\n");
61			painCave.isFatal = 1;;
62			simError();
63	tim	2076	}
64
65	tim	2072	int nProcessors;
66			MPI_Comm_size(MPI_COMM_WORLD, &nProcessors);
67	tim	2082	MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
68	tim	2076	//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	tim	2082	mtRand_ = new MTRand(newSeed, nProcessors, myRank_);
73	tim	2072
74			++nCreatedRNG_;
75	gezelter	2204	}
76	tim	2072
77	gezelter	2204	ParallelRandNumGen::ParallelRandNumGen() {
78	tim	2072
79			std::vector<uint32> bigSeed;
80			const int masterNode = 0;
81			int nProcessors;
82			MPI_Comm_size(MPI_COMM_WORLD, &nProcessors);
83	tim	2082	MPI_Comm_rank( MPI_COMM_WORLD, &myRank_);
84			mtRand_ = new MTRand(nProcessors, myRank_);
85	tim	2072
86	tim	2076	seed(); /** @todo calling virtual function in constructor is not a good design */
87	gezelter	2204	}
88	tim	2072
89
90	gezelter	2204	void ParallelRandNumGen::seed( const uint32 oneSeed ) {
91	tim	2072
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	gezelter	2204	sprintf(painCave.errMsg,
98			"Using different seed to initialize ParallelRandNumGen.\n");
99			painCave.isFatal = 1;;
100			simError();
101	tim	2072	}
102
103			int newSeed = oneSeed +nCreatedRNG_;
104			mtRand_->seed(newSeed);
105
106			++nCreatedRNG_;
107	gezelter	2204	}
108	tim	2072
109	gezelter	2204	void ParallelRandNumGen::seed() {
110	tim	2072
111			std::vector<uint32> bigSeed;
112			int size;
113			const int masterNode = 0;
114			if (worldRank == masterNode) {
115	gezelter	2204	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	tim	2072
120			}else {
121	gezelter	2204	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	tim	2072	}
125
126			if (bigSeed.size() == 1) {
127	gezelter	2204	mtRand_->seed(bigSeed[0]);
128	tim	2072	} else {
129	gezelter	2204	mtRand_->seed(&bigSeed[0], bigSeed.size());
130	tim	2072	}
131
132			++nCreatedRNG_;
133	gezelter	2204	}
134	tim	2072
135
136			}
137
138			#endif