499 строки
17 KiB
C
499 строки
17 KiB
C
/* -*- Mode: C; c-basic-offset:2 ; indent-tabs-mode:nil -*- */
|
|
/*
|
|
* Copyright (c) 2006 The Trustees of Indiana University and Indiana
|
|
* University Research and Technology
|
|
* Corporation. All rights reserved.
|
|
* Copyright (c) 2006 The Technical University of Chemnitz. All
|
|
* rights reserved.
|
|
* Copyright (c) 2013-2015 Los Alamos National Security, LLC. All rights
|
|
* reserved.
|
|
* Copyright (c) 2014 NVIDIA Corporation. All rights reserved.
|
|
* Copyright (c) 2014-2015 Research Organization for Information Science
|
|
* and Technology (RIST). All rights reserved.
|
|
*
|
|
* Author(s): Torsten Hoefler <htor@cs.indiana.edu>
|
|
*
|
|
*/
|
|
#include "nbc_internal.h"
|
|
|
|
static inline int a2a_sched_linear(int rank, int p, MPI_Aint sndext, MPI_Aint rcvext, NBC_Schedule *schedule,
|
|
const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf,
|
|
int recvcount, MPI_Datatype recvtype, MPI_Comm comm);
|
|
static inline int a2a_sched_pairwise(int rank, int p, MPI_Aint sndext, MPI_Aint rcvext, NBC_Schedule *schedule,
|
|
const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf,
|
|
int recvcount, MPI_Datatype recvtype, MPI_Comm comm);
|
|
static inline int a2a_sched_diss(int rank, int p, MPI_Aint sndext, MPI_Aint rcvext, NBC_Schedule* schedule,
|
|
const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf,
|
|
int recvcount, MPI_Datatype recvtype, MPI_Comm comm, NBC_Handle *handle);
|
|
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
/* tree comparison function for schedule cache */
|
|
int NBC_Alltoall_args_compare(NBC_Alltoall_args *a, NBC_Alltoall_args *b, void *param) {
|
|
if ((a->sendbuf == b->sendbuf) &&
|
|
(a->sendcount == b->sendcount) &&
|
|
(a->sendtype == b->sendtype) &&
|
|
(a->recvbuf == b->recvbuf) &&
|
|
(a->recvcount == b->recvcount) &&
|
|
(a->recvtype == b->recvtype)) {
|
|
return 0;
|
|
}
|
|
|
|
if( a->sendbuf < b->sendbuf ) {
|
|
return -1;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
#endif
|
|
|
|
/* simple linear MPI_Ialltoall the (simple) algorithm just sends to all nodes */
|
|
int ompi_coll_libnbc_ialltoall(const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf, int recvcount,
|
|
MPI_Datatype recvtype, struct ompi_communicator_t *comm, ompi_request_t ** request,
|
|
struct mca_coll_base_module_2_1_0_t *module)
|
|
{
|
|
int rank, p, res, datasize;
|
|
size_t a2asize, sndsize;
|
|
NBC_Schedule *schedule;
|
|
MPI_Aint rcvext, sndext;
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
NBC_Alltoall_args *args, *found, search;
|
|
#endif
|
|
char *rbuf, *sbuf, inplace;
|
|
enum {NBC_A2A_LINEAR, NBC_A2A_PAIRWISE, NBC_A2A_DISS} alg;
|
|
NBC_Handle *handle;
|
|
ompi_coll_libnbc_module_t *libnbc_module = (ompi_coll_libnbc_module_t*) module;
|
|
|
|
NBC_IN_PLACE(sendbuf, recvbuf, inplace);
|
|
|
|
rank = ompi_comm_rank (comm);
|
|
p = ompi_comm_size (comm);
|
|
|
|
res = ompi_datatype_type_extent(sendtype, &sndext);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error("MPI Error in ompi_datatype_type_extent() (%i)", res);
|
|
return res;
|
|
}
|
|
|
|
res = ompi_datatype_type_extent(recvtype, &rcvext);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error("MPI Error in ompi_datatype_type_extent() (%i)", res);
|
|
return res;
|
|
}
|
|
|
|
res = ompi_datatype_type_size(sendtype, &sndsize);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error("MPI Error in ompi_datatype_type_size() (%i)", res);
|
|
return res;
|
|
}
|
|
|
|
/* algorithm selection */
|
|
a2asize = sndsize * sendcount * p;
|
|
/* this number is optimized for TCP on odin.cs.indiana.edu */
|
|
if((p <= 8) && ((a2asize < 1<<17) || (sndsize*sendcount < 1<<12))) {
|
|
/* just send as fast as we can if we have less than 8 peers, if the
|
|
* total communicated size is smaller than 1<<17 *and* if we don't
|
|
* have eager messages (msgsize < 1<<13) */
|
|
alg = NBC_A2A_LINEAR;
|
|
} else if(a2asize < (1<<12)*(unsigned int)p) {
|
|
/*alg = NBC_A2A_DISS;*/
|
|
alg = NBC_A2A_LINEAR;
|
|
} else
|
|
alg = NBC_A2A_LINEAR; /*NBC_A2A_PAIRWISE;*/
|
|
|
|
if (!inplace) {
|
|
/* copy my data to receive buffer */
|
|
rbuf = (char *) recvbuf + rank * recvcount * rcvext;
|
|
sbuf = (char *) sendbuf + rank * sendcount * sndext;
|
|
res = NBC_Copy (sbuf, sendcount, sendtype, rbuf, recvcount, recvtype, comm);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
}
|
|
|
|
res = NBC_Init_handle(comm, &handle, libnbc_module);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
/* allocate temp buffer if we need one */
|
|
if (alg == NBC_A2A_DISS) {
|
|
/* only A2A_DISS needs buffers */
|
|
if(NBC_Type_intrinsic(sendtype)) {
|
|
datasize = sndext * sendcount;
|
|
} else {
|
|
res = PMPI_Pack_size (sendcount, sendtype, comm, &datasize);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error("MPI Error in PMPI_Pack_size() (%i)", res);
|
|
NBC_Return_handle (handle);
|
|
return res;
|
|
}
|
|
}
|
|
|
|
/* allocate temporary buffers */
|
|
if ((p & 1) == 0) {
|
|
handle->tmpbuf = malloc (datasize * p * 2);
|
|
} else {
|
|
/* we cannot divide p by two, so alloc more to be safe ... */
|
|
handle->tmpbuf = malloc (datasize * (p / 2 + 1) * 2 * 2);
|
|
}
|
|
|
|
if (OPAL_UNLIKELY(NULL == handle->tmpbuf)) {
|
|
NBC_Return_handle (handle);
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
}
|
|
|
|
/* phase 1 - rotate n data blocks upwards into the tmpbuffer */
|
|
#if OPAL_CUDA_SUPPORT
|
|
if (NBC_Type_intrinsic(sendtype) && !(opal_cuda_check_bufs((char *)sendbuf, (char *)recvbuf))) {
|
|
#else
|
|
if (NBC_Type_intrinsic(sendtype)) {
|
|
#endif /* OPAL_CUDA_SUPPORT */
|
|
/* contiguous - just copy (1st copy) */
|
|
memcpy (handle->tmpbuf, (char *) sendbuf + datasize * rank, datasize * (p - rank));
|
|
if (rank != 0) {
|
|
memcpy ((char *) handle->tmpbuf + datasize * (p - rank), sendbuf, datasize * rank);
|
|
}
|
|
} else {
|
|
int pos=0;
|
|
|
|
/* non-contiguous - pack */
|
|
res = PMPI_Pack ((char *) sendbuf + rank * sendcount * sndext, (p - rank) * sendcount, sendtype, handle->tmpbuf,
|
|
(p - rank) * datasize, &pos, comm);
|
|
if (OPAL_UNLIKELY(MPI_SUCCESS != res)) {
|
|
NBC_Error("MPI Error in PMPI_Pack() (%i)", res);
|
|
NBC_Return_handle (handle);
|
|
return res;
|
|
}
|
|
|
|
if (rank != 0) {
|
|
pos = 0;
|
|
res = PMPI_Pack(sendbuf, rank * sendcount, sendtype, (char *) handle->tmpbuf + datasize * (p - rank),
|
|
rank * datasize, &pos, comm);
|
|
if (OPAL_UNLIKELY(MPI_SUCCESS != res)) {
|
|
NBC_Error("MPI Error in PMPI_Pack() (%i)", res);
|
|
NBC_Return_handle (handle);
|
|
return res;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
/* search schedule in communicator specific tree */
|
|
search.sendbuf = sendbuf;
|
|
search.sendcount = sendcount;
|
|
search.sendtype = sendtype;
|
|
search.recvbuf = recvbuf;
|
|
search.recvcount = recvcount;
|
|
search.recvtype = recvtype;
|
|
found = (NBC_Alltoall_args *) hb_tree_search ((hb_tree *) libnbc_module->NBC_Dict[NBC_ALLTOALL], &search);
|
|
if (NULL == found) {
|
|
#endif
|
|
/* not found - generate new schedule */
|
|
schedule = OBJ_NEW(NBC_Schedule);
|
|
if (OPAL_UNLIKELY(NULL == schedule)) {
|
|
NBC_Return_handle (handle);
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
}
|
|
|
|
/* ensure the schedule is released with the handle on error */
|
|
handle->schedule = schedule;
|
|
|
|
switch(alg) {
|
|
case NBC_A2A_LINEAR:
|
|
res = a2a_sched_linear(rank, p, sndext, rcvext, schedule, sendbuf, sendcount, sendtype, recvbuf, recvcount, recvtype, comm);
|
|
break;
|
|
case NBC_A2A_DISS:
|
|
res = a2a_sched_diss(rank, p, sndext, rcvext, schedule, sendbuf, sendcount, sendtype, recvbuf, recvcount, recvtype, comm, handle);
|
|
break;
|
|
case NBC_A2A_PAIRWISE:
|
|
res = a2a_sched_pairwise(rank, p, sndext, rcvext, schedule, sendbuf, sendcount, sendtype, recvbuf, recvcount, recvtype, comm);
|
|
break;
|
|
}
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
NBC_Return_handle (handle);
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Sched_commit(schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
NBC_Return_handle (handle);
|
|
return res;
|
|
}
|
|
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
/* save schedule to tree */
|
|
args = (NBC_Alltoall_args *) malloc (sizeof (args));
|
|
if (NULL != args) {
|
|
args->sendbuf = sendbuf;
|
|
args->sendcount = sendcount;
|
|
args->sendtype = sendtype;
|
|
args->recvbuf = recvbuf;
|
|
args->recvcount = recvcount;
|
|
args->recvtype = recvtype;
|
|
args->schedule = schedule;
|
|
res = hb_tree_insert ((hb_tree *) libnbc_module->NBC_Dict[NBC_ALLTOALL], args, args, 0);
|
|
if (0 == res) {
|
|
OBJ_RETAIN(schedule);
|
|
|
|
/* increase number of elements for A2A */
|
|
if (++libnbc_module->NBC_Dict_size[NBC_ALLTOALL] > NBC_SCHED_DICT_UPPER) {
|
|
NBC_SchedCache_dictwipe ((hb_tree *) libnbc_module->NBC_Dict[NBC_ALLTOALL],
|
|
&libnbc_module->NBC_Dict_size[NBC_ALLTOALL]);
|
|
}
|
|
} else {
|
|
NBC_Error("error in dict_insert() (%i)", res);
|
|
free (args);
|
|
}
|
|
}
|
|
} else {
|
|
/* found schedule */
|
|
schedule = found->schedule;
|
|
OBJ_RETAIN(schedule);
|
|
}
|
|
#endif
|
|
|
|
res = NBC_Start (handle, schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
NBC_Return_handle (handle);
|
|
return res;
|
|
}
|
|
|
|
*request = (ompi_request_t *) handle;
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
int ompi_coll_libnbc_ialltoall_inter (const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf, int recvcount,
|
|
MPI_Datatype recvtype, struct ompi_communicator_t *comm, ompi_request_t ** request,
|
|
struct mca_coll_base_module_2_1_0_t *module)
|
|
{
|
|
int res, rsize;
|
|
MPI_Aint sndext, rcvext;
|
|
NBC_Schedule *schedule;
|
|
char *rbuf, *sbuf;
|
|
NBC_Handle *handle;
|
|
ompi_coll_libnbc_module_t *libnbc_module = (ompi_coll_libnbc_module_t*) module;
|
|
|
|
rsize = ompi_comm_remote_size (comm);
|
|
|
|
res = ompi_datatype_type_extent (sendtype, &sndext);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error("MPI Error in ompi_datatype_type_extent() (%i)", res);
|
|
return res;
|
|
}
|
|
|
|
res = ompi_datatype_type_extent (recvtype, &rcvext);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error("MPI Error in ompi_datatype_type_extent() (%i)", res);
|
|
return res;
|
|
}
|
|
|
|
schedule = OBJ_NEW(NBC_Schedule);
|
|
if (OPAL_UNLIKELY(NULL == schedule)) {
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
}
|
|
|
|
for (int i = 0; i < rsize; i++) {
|
|
/* post all sends */
|
|
sbuf = (char *) sendbuf + i * sendcount * sndext;
|
|
res = NBC_Sched_send (sbuf, false, sendcount, sendtype, i, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
break;
|
|
}
|
|
|
|
/* post all receives */
|
|
rbuf = (char *) recvbuf + i * recvcount * rcvext;
|
|
res = NBC_Sched_recv (rbuf, false, recvcount, recvtype, i, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Sched_commit (schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Init_handle (comm, &handle, libnbc_module);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Start (handle, schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
NBC_Return_handle (handle);
|
|
return res;
|
|
}
|
|
|
|
*request = (ompi_request_t *) handle;
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
static inline int a2a_sched_pairwise(int rank, int p, MPI_Aint sndext, MPI_Aint rcvext, NBC_Schedule* schedule,
|
|
const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf, int recvcount,
|
|
MPI_Datatype recvtype, MPI_Comm comm) {
|
|
int res;
|
|
|
|
if (p < 2) {
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
for (int r = 1 ; r < p ; ++r) {
|
|
int sndpeer = (rank + r) % p;
|
|
int rcvpeer = (rank - r + p) % p;
|
|
|
|
char *rbuf = (char *) recvbuf + rcvpeer * recvcount * rcvext;
|
|
res = NBC_Sched_recv (rbuf, false, recvcount, recvtype, rcvpeer, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
char *sbuf = (char *) sendbuf + sndpeer * sendcount * sndext;
|
|
res = NBC_Sched_send (sbuf, false, sendcount, sendtype, sndpeer, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
if (r < p) {
|
|
res = NBC_Sched_barrier (schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
}
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
static inline int a2a_sched_linear(int rank, int p, MPI_Aint sndext, MPI_Aint rcvext, NBC_Schedule* schedule,
|
|
const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf, int recvcount,
|
|
MPI_Datatype recvtype, MPI_Comm comm) {
|
|
int res;
|
|
|
|
for (int r = 0 ; r < p ; ++r) {
|
|
/* easy algorithm */
|
|
if (r == rank) {
|
|
continue;
|
|
}
|
|
|
|
char *rbuf = (char *) recvbuf + r * recvcount * rcvext;
|
|
res = NBC_Sched_recv (rbuf, false, recvcount, recvtype, r, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
char *sbuf = (char *) sendbuf + r * sendcount * sndext;
|
|
res = NBC_Sched_send (sbuf, false, sendcount, sendtype, r, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
static inline int a2a_sched_diss(int rank, int p, MPI_Aint sndext, MPI_Aint rcvext, NBC_Schedule* schedule,
|
|
const void* sendbuf, int sendcount, MPI_Datatype sendtype, void* recvbuf, int recvcount,
|
|
MPI_Datatype recvtype, MPI_Comm comm, NBC_Handle *handle) {
|
|
int res, speer, rpeer, datasize, offset, virtp;
|
|
char *rbuf, *rtmpbuf, *stmpbuf;
|
|
|
|
if (p < 2) {
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
if(NBC_Type_intrinsic(sendtype)) {
|
|
datasize = sndext*sendcount;
|
|
} else {
|
|
res = PMPI_Pack_size(sendcount, sendtype, comm, &datasize);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error("MPI Error in PMPI_Pack_size() (%i)", res);
|
|
return res;
|
|
}
|
|
}
|
|
|
|
/* allocate temporary buffers */
|
|
if ((p & 1) == 0) {
|
|
rtmpbuf = (char *) handle->tmpbuf + datasize * p;
|
|
stmpbuf = (char *) handle->tmpbuf + datasize * (p + p / 2);
|
|
} else {
|
|
/* we cannot divide p by two, so alloc more to be safe ... */
|
|
virtp = (p / 2 + 1) * 2;
|
|
rtmpbuf = (char *) handle->tmpbuf + datasize * p;
|
|
stmpbuf = (char *) handle->tmpbuf + datasize * (p + virtp / 2);
|
|
}
|
|
|
|
/* phase 2 - communicate */
|
|
for (int r = 1; r < p; r <<= 1) {
|
|
offset = 0;
|
|
for (int i = 1 ; i < p; ++i) {
|
|
/* test if bit r is set in rank number i */
|
|
if (i & r) {
|
|
/* copy data to sendbuffer (2nd copy) - could be avoided using iovecs */
|
|
/*printf("[%i] round %i: copying element %i to buffer %lu\n", rank, r, i, (unsigned long)(stmpbuf+offset));*/
|
|
res = NBC_Sched_copy((void *)(intptr_t)(i * datasize), true, datasize, MPI_BYTE, stmpbuf + offset -
|
|
(intptr_t) handle->tmpbuf, true, datasize, MPI_BYTE, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
offset += datasize;
|
|
}
|
|
}
|
|
|
|
speer = (rank + r) % p;
|
|
/* add p because modulo does not work with negative values */
|
|
rpeer = ((rank - r) + p) % p;
|
|
|
|
res = NBC_Sched_recv (rtmpbuf - (intptr_t) handle->tmpbuf, true, offset, MPI_BYTE, rpeer, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Sched_send (stmpbuf - (intptr_t) handle->tmpbuf, true, offset, MPI_BYTE, speer, schedule, true);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
/* unpack from buffer */
|
|
offset = 0;
|
|
for (int i = 1; i < p; ++i) {
|
|
/* test if bit r is set in rank number i */
|
|
if (i & r) {
|
|
/* copy data to tmpbuffer (3rd copy) - could be avoided using iovecs */
|
|
res = NBC_Sched_copy (rtmpbuf + offset - (intptr_t) handle->tmpbuf, true, datasize, MPI_BYTE,
|
|
(void *)(intptr_t)(i * datasize), true, datasize, MPI_BYTE, schedule,
|
|
false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
offset += datasize;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* phase 3 - reorder - data is now in wrong order in handle->tmpbuf -
|
|
* reorder it into recvbuf */
|
|
for (int i = 0 ; i < p; ++i) {
|
|
rbuf = (char *) recvbuf + ((rank - i + p) % p) * recvcount * rcvext;
|
|
res = NBC_Sched_unpack ((void *)(intptr_t) (i * datasize), true, recvcount, recvtype, rbuf, false, schedule,
|
|
false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|