| 46 |
|
* [4] Vardeman & Gezelter, in progress (2009). |
| 47 |
|
*/ |
| 48 |
|
|
| 49 |
< |
#ifndef FORCEDECOMPOSITION_COMMUNICATOR_HPP |
| 50 |
< |
#define FORCEDECOMPOSITION_COMMUNICATOR_HPP |
| 49 |
> |
#ifndef PARALLEL_COMMUNICATOR_HPP |
| 50 |
> |
#define PARALLEL_COMMUNICATOR_HPP |
| 51 |
|
|
| 52 |
|
#include <config.h> |
| 53 |
|
#include <mpi.h> |
| 54 |
|
#include "math/SquareMatrix3.hpp" |
| 55 |
|
|
| 56 |
+ |
using namespace std; |
| 57 |
|
namespace OpenMD{ |
| 58 |
|
|
| 59 |
|
#ifdef IS_MPI |
| 60 |
|
|
| 61 |
< |
enum direction { |
| 62 |
< |
Row = 0, |
| 63 |
< |
Column = 1 |
| 61 |
> |
enum communicatorType { |
| 62 |
> |
Global = 0, |
| 63 |
> |
Row = 1, |
| 64 |
> |
Column = 2 |
| 65 |
|
}; |
| 66 |
|
|
| 67 |
< |
template<typename T> |
| 68 |
< |
struct MPITraits |
| 69 |
< |
{ |
| 70 |
< |
static const MPI::Datatype datatype; |
| 71 |
< |
static const int dim; |
| 67 |
> |
template<class T> |
| 68 |
> |
class MPITraits { |
| 69 |
> |
public: |
| 70 |
> |
static MPI::Datatype Type(); |
| 71 |
> |
static int Length() { return 1; }; |
| 72 |
|
}; |
| 73 |
|
|
| 74 |
< |
template<> const MPI::Datatype MPITraits<int>::datatype = MPI_INT; |
| 75 |
< |
template<> const int MPITraits<int>::dim = 1; |
| 76 |
< |
template<> const MPI::Datatype MPITraits<RealType>::datatype = MPI_REALTYPE; |
| 77 |
< |
template<> const int MPITraits<RealType>::dim = 1; |
| 78 |
< |
template<> const MPI::Datatype MPITraits<Vector3d>::datatype = MPI_REALTYPE; |
| 79 |
< |
template<> const int MPITraits<Vector3d>::dim = 3; |
| 80 |
< |
template<> const MPI::Datatype MPITraits<Mat3x3d>::datatype = MPI_REALTYPE; |
| 81 |
< |
template<> const int MPITraits<Mat3x3d>::dim = 9; |
| 74 |
> |
template<> inline MPI::Datatype MPITraits<int>::Type() { return MPI_INT; } |
| 75 |
> |
template<> inline MPI::Datatype MPITraits<RealType>::Type() { return MPI_REALTYPE; } |
| 76 |
> |
|
| 77 |
> |
template<class T, unsigned int Dim> |
| 78 |
> |
class MPITraits< Vector<T, Dim> > { |
| 79 |
> |
public: |
| 80 |
> |
static MPI::Datatype Type() { return MPITraits<T>::Type(); } |
| 81 |
> |
static int Length() {return Dim;} |
| 82 |
> |
}; |
| 83 |
> |
|
| 84 |
> |
template<class T> |
| 85 |
> |
class MPITraits< Vector3<T> > { |
| 86 |
> |
public: |
| 87 |
> |
static MPI::Datatype Type() { return MPITraits<T>::Type(); } |
| 88 |
> |
static int Length() {return 3;} |
| 89 |
> |
}; |
| 90 |
> |
|
| 91 |
> |
template<class T, unsigned int Row, unsigned int Col> |
| 92 |
> |
class MPITraits< RectMatrix<T, Row, Col> > { |
| 93 |
> |
public: |
| 94 |
> |
static MPI::Datatype Type() { return MPITraits<T>::Type(); } |
| 95 |
> |
static int Length() {return Row * Col;} |
| 96 |
> |
}; |
| 97 |
> |
|
| 98 |
> |
template<class T> |
| 99 |
> |
class MPITraits< SquareMatrix3<T> > { |
| 100 |
> |
public: |
| 101 |
> |
static MPI::Datatype Type() { return MPITraits<T>::Type(); } |
| 102 |
> |
static int Length() {return 9;} |
| 103 |
> |
}; |
| 104 |
|
|
| 105 |
< |
template<direction D, typename T> |
| 105 |
> |
|
| 106 |
> |
template<communicatorType D, typename T> |
| 107 |
|
class Communicator { |
| 108 |
|
public: |
| 109 |
|
|
| 123 |
|
rowIndex_ = myRank / nColumns; |
| 124 |
|
columnIndex_ = myRank % nColumns; |
| 125 |
|
|
| 126 |
< |
if (D == Row) { |
| 126 |
> |
switch(D) { |
| 127 |
> |
case Row : |
| 128 |
|
myComm = MPI::COMM_WORLD.Split(rowIndex_, 0); |
| 129 |
< |
} else { |
| 129 |
> |
break; |
| 130 |
> |
case Column: |
| 131 |
|
myComm = MPI::COMM_WORLD.Split(columnIndex_, 0); |
| 132 |
+ |
break; |
| 133 |
+ |
case Global: |
| 134 |
+ |
myComm = MPI::COMM_WORLD.Split(myRank, 0); |
| 135 |
|
} |
| 136 |
|
|
| 137 |
|
int nCommProcs = myComm.Get_size(); |
| 139 |
|
counts.reserve(nCommProcs); |
| 140 |
|
displacements.reserve(nCommProcs); |
| 141 |
|
|
| 142 |
< |
planSize_ = MPITraits<T>::dim * nObjects; |
| 142 |
> |
planSize_ = MPITraits<T>::Length() * nObjects; |
| 143 |
|
|
| 144 |
|
myComm.Allgather(&planSize_, 1, MPI::INT, &counts[0], 1, MPI::INT); |
| 145 |
|
|
| 146 |
|
displacements[0] = 0; |
| 147 |
|
for (int i = 1; i < nCommProcs; i++) { |
| 148 |
|
displacements[i] = displacements[i-1] + counts[i-1]; |
| 149 |
< |
} |
| 149 |
> |
size_ += counts[i-1]; |
| 150 |
> |
} |
| 151 |
> |
|
| 152 |
> |
size_ = 0; |
| 153 |
> |
for (int i = 0; i < nCommProcs; i++) { |
| 154 |
> |
size_ += counts[i]; |
| 155 |
> |
} |
| 156 |
|
} |
| 157 |
|
|
| 158 |
< |
|
| 159 |
< |
void gather(std::vector<T>& v1, std::vector<T>& v2) { |
| 158 |
> |
|
| 159 |
> |
void gather(vector<T>& v1, vector<T>& v2) { |
| 160 |
|
|
| 161 |
|
myComm.Allgatherv(&v1[0], |
| 162 |
|
planSize_, |
| 163 |
< |
MPITraits<T>::datatype, |
| 163 |
> |
MPITraits<T>::Type(), |
| 164 |
|
&v2[0], |
| 165 |
|
&counts[0], |
| 166 |
|
&displacements[0], |
| 167 |
< |
MPITraits<T>::datatype); |
| 167 |
> |
MPITraits<T>::Type()); |
| 168 |
|
} |
| 133 |
– |
|
| 169 |
|
|
| 170 |
< |
|
| 171 |
< |
void scatter(std::vector<T>& v1, std::vector<T>& v2) { |
| 172 |
< |
|
| 170 |
> |
|
| 171 |
> |
|
| 172 |
> |
void scatter(vector<T>& v1, vector<T>& v2) { |
| 173 |
> |
|
| 174 |
|
myComm.Reduce_scatter(&v1[0], &v2[0], &counts[0], |
| 175 |
< |
MPITraits<T>::datatype, MPI::SUM); |
| 175 |
> |
MPITraits<T>::Type(), MPI::SUM); |
| 176 |
|
} |
| 177 |
|
|
| 178 |
+ |
int getSize() { |
| 179 |
+ |
return size_; |
| 180 |
+ |
} |
| 181 |
+ |
|
| 182 |
|
private: |
| 183 |
|
int planSize_; ///< how many are on local proc |
| 184 |
|
int rowIndex_; |
| 185 |
|
int columnIndex_; |
| 186 |
< |
std::vector<int> counts; |
| 187 |
< |
std::vector<int> displacements; |
| 186 |
> |
int size_; |
| 187 |
> |
vector<int> counts; |
| 188 |
> |
vector<int> displacements; |
| 189 |
|
MPI::Intracomm myComm; |
| 190 |
|
}; |
| 191 |
|
|
