X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/2b2677ab2f08298e2517f5ee3f56dfb9916234b6..15f804cfddebc4fe4b305acd1c66487f2405420d:/src/smpi/mpi/smpi_topo.cpp diff --git a/src/smpi/mpi/smpi_topo.cpp b/src/smpi/mpi/smpi_topo.cpp index 7ce25d4763..424e3496ea 100644 --- a/src/smpi/mpi/smpi_topo.cpp +++ b/src/smpi/mpi/smpi_topo.cpp @@ -19,6 +19,14 @@ static int getfactors(int num, int *nfators, int **factors); namespace simgrid{ namespace smpi{ +void Topo::setComm(MPI_Comm comm) +{ + xbt_assert(not comm_); + comm_ = comm; + if (comm_) + comm_->topo_ = this; +} + /******************************************************************************* * Cartesian topologies ******************************************************************************/ @@ -29,7 +37,7 @@ Topo_Cart::Topo_Cart(int ndims) : ndims_(ndims), dims_(ndims), periodic_(ndims), /* reorder is ignored, don't know what would be the consequences of a dumb reordering but neither do I see the point of * reordering*/ -Topo_Cart::Topo_Cart(MPI_Comm comm_old, int ndims, int dims[], int periods[], int /*reorder*/, MPI_Comm* comm_cart) +Topo_Cart::Topo_Cart(MPI_Comm comm_old, int ndims, const int dims[], const int periods[], int /*reorder*/, MPI_Comm* comm_cart) : Topo_Cart(ndims) { MPI_Group newGroup; @@ -43,14 +51,10 @@ Topo_Cart::Topo_Cart(MPI_Comm comm_old, int ndims, int dims[], int periods[], in newSize *= dims[i]; } if(rank >= newSize) { - *comm_cart = MPI_COMM_NULL; + if(comm_cart != nullptr) + *comm_cart = MPI_COMM_NULL; return; } - oldGroup = comm_old->group(); - newGroup = new Group(newSize); - for (int i = 0 ; i < newSize ; i++) { - newGroup->set_mapping(oldGroup->actor(i), i); - } nnodes_ = newSize; @@ -64,16 +68,26 @@ Topo_Cart::Topo_Cart(MPI_Comm comm_old, int ndims, int dims[], int periods[], in position_[i] = rank / nranks; rank = rank % nranks; } - - *comm_cart = new Comm(newGroup, this); + + if(comm_cart != nullptr){ + oldGroup = comm_old->group(); + newGroup = new Group(newSize); + for (int i = 0 ; i < newSize ; i++) { + newGroup->set_mapping(oldGroup->actor(i), i); + } + *comm_cart = new Comm(newGroup, this); + } } else { - if (rank == 0) { - *comm_cart = new Comm(new Group(MPI_COMM_SELF->group()), this); - } else { - *comm_cart = MPI_COMM_NULL; + if(comm_cart != nullptr){ + if (rank == 0) { + *comm_cart = new Comm(new Group(MPI_COMM_SELF->group()), this); + } else { + *comm_cart = MPI_COMM_NULL; + } } } - setComm(*comm_cart); + if(comm_cart != nullptr) + setComm(*comm_cart); } Topo_Cart* Topo_Cart::sub(const int remain_dims[], MPI_Comm *newcomm) { @@ -104,7 +118,22 @@ Topo_Cart* Topo_Cart::sub(const int remain_dims[], MPI_Comm *newcomm) { } } } - Topo_Cart* res = new Topo_Cart(getComm(), newNDims, newDims, newPeriodic, 0, newcomm); + + //split into several communicators + int color = 0; + for (int i = 0; i < oldNDims; i++) { + if (not remain_dims[i]) { + color = (color * dims_[i] + position_[i]); + } + } + Topo_Cart* res; + if (newNDims == 0){ + res = new Topo_Cart(getComm(), newNDims, newDims, newPeriodic, 0, newcomm); + } else { + *newcomm = getComm()->split(color, getComm()->rank()); + res = new Topo_Cart(getComm(), newNDims, newDims, newPeriodic, 0, nullptr); + res->setComm(*newcomm); + } delete[] newDims; delete[] newPeriodic; return res; @@ -131,7 +160,7 @@ int Topo_Cart::get(int maxdims, int* dims, int* periods, int* coords) { return MPI_SUCCESS; } -int Topo_Cart::rank(int* coords, int* rank) { +int Topo_Cart::rank(const int* coords, int* rank) { int ndims =ndims_; *rank = 0; int multiplier = 1; @@ -167,10 +196,8 @@ int Topo_Cart::rank(int* coords, int* rank) { return MPI_SUCCESS; } -int Topo_Cart::shift(int direction, int disp, int *rank_source, int *rank_dest) { - - int position[ndims_]; - +int Topo_Cart::shift(int direction, int disp, int* rank_source, int* rank_dest) +{ if(ndims_ == 0) { return MPI_ERR_ARG; } @@ -178,6 +205,7 @@ int Topo_Cart::shift(int direction, int disp, int *rank_source, int *rank_dest) return MPI_ERR_DIMS; } + int* position = new int[ndims_]; this->coords(getComm()->rank(), ndims_, position); position[direction] += disp; @@ -204,7 +232,7 @@ int Topo_Cart::shift(int direction, int disp, int *rank_source, int *rank_dest) } else { this->rank(position, rank_source); } - + delete[] position; return MPI_SUCCESS; } @@ -387,8 +415,8 @@ static int getfactors(int num, int *nfactors, int **factors) { return MPI_SUCCESS; } /* Allocate the array of prime factors which cannot exceed log_2(num) entries */ - int sqrtnum = ceil(sqrt(num)); - int size = ceil(log(num) / log(2)); + int sqrtnum = ceil(sqrt(double(num))); + int size = ceil(log(double(num)) / log(2.0)); *factors = new int[size]; int i = 0;