390 строки
13 KiB
C
390 строки
13 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) 2012 Sandia National Laboratories. All rights reserved.
|
|
* Copyright (c) 2013-2015 Los Alamos National Security, LLC. All rights
|
|
* reserved.
|
|
* Copyright (c) 2014-2018 Research Organization for Information Science
|
|
* and Technology (RIST). All rights reserved.
|
|
* Copyright (c) 2017 IBM Corporation. All rights reserved.
|
|
* Copyright (c) 2018 FUJITSU LIMITED. All rights reserved.
|
|
* $COPYRIGHT$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* Author(s): Torsten Hoefler <htor@cs.indiana.edu>
|
|
*
|
|
*/
|
|
#include "opal/align.h"
|
|
|
|
#include "nbc_internal.h"
|
|
|
|
/* an reduce_csttare schedule can not be cached easily because the contents
|
|
* ot the recvcount value may change, so a comparison of the address
|
|
* would not be sufficient ... we simply do not cache it */
|
|
|
|
/* binomial reduce to rank 0 followed by a linear scatter ...
|
|
*
|
|
* Algorithm:
|
|
* pairwise exchange
|
|
* round r:
|
|
* grp = rank % 2^r
|
|
* if grp == 0: receive from rank + 2^(r-1) if it exists and reduce value
|
|
* if grp == 1: send to rank - 2^(r-1) and exit function
|
|
*
|
|
* do this for R=log_2(p) rounds
|
|
*
|
|
*/
|
|
|
|
static int nbc_reduce_scatter_block_init(const void* sendbuf, void* recvbuf, int recvcount, MPI_Datatype datatype,
|
|
MPI_Op op, struct ompi_communicator_t *comm, ompi_request_t ** request,
|
|
struct mca_coll_base_module_2_3_0_t *module, bool persistent) {
|
|
int peer, rank, maxr, p, res, count;
|
|
MPI_Aint ext;
|
|
ptrdiff_t gap, span;
|
|
char *redbuf, *sbuf, inplace;
|
|
NBC_Schedule *schedule;
|
|
void *tmpbuf = NULL;
|
|
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(datatype, &ext);
|
|
if (MPI_SUCCESS != res || 0 == ext) {
|
|
NBC_Error ("MPI Error in ompi_datatype_type_extent() (%i:%i)", res, (int) ext);
|
|
return (MPI_SUCCESS == res) ? MPI_ERR_SIZE : res;
|
|
}
|
|
|
|
schedule = OBJ_NEW(NBC_Schedule);
|
|
if (NULL == schedule) {
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
}
|
|
|
|
maxr = (int)ceil((log((double)p)/LOG2));
|
|
|
|
count = p * recvcount;
|
|
|
|
if (0 < count) {
|
|
char *rbuf, *lbuf, *buf;
|
|
ptrdiff_t span_align;
|
|
|
|
span = opal_datatype_span(&datatype->super, count, &gap);
|
|
span_align = OPAL_ALIGN(span, datatype->super.align, ptrdiff_t);
|
|
tmpbuf = malloc (span_align + span);
|
|
if (NULL == tmpbuf) {
|
|
OBJ_RELEASE(schedule);
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
}
|
|
|
|
rbuf = (void *)(-gap);
|
|
lbuf = (char *)(span_align - gap);
|
|
redbuf = (char *) tmpbuf + span_align - gap;
|
|
|
|
/* copy data to redbuf if we only have a single node */
|
|
if ((p == 1) && !inplace) {
|
|
res = NBC_Sched_copy ((void *)sendbuf, false, count, datatype,
|
|
redbuf, false, count, datatype, schedule, false);
|
|
if (OMPI_SUCCESS != res) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
}
|
|
|
|
for (int r = 1, firstred = 1 ; r <= maxr; ++r) {
|
|
if ((rank % (1 << r)) == 0) {
|
|
/* we have to receive this round */
|
|
peer = rank + (1 << (r - 1));
|
|
if (peer < p) {
|
|
/* we have to wait until we have the data */
|
|
res = NBC_Sched_recv (rbuf, true, count, datatype, peer, schedule, true);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
if (firstred) {
|
|
/* take reduce data from the sendbuf in the first round -> save copy */
|
|
res = NBC_Sched_op (sendbuf, false, rbuf, true, count, datatype, op, schedule, true);
|
|
firstred = 0;
|
|
} else {
|
|
/* perform the reduce in my local buffer */
|
|
res = NBC_Sched_op (lbuf, true, rbuf, true, count, datatype, op, schedule, true);
|
|
}
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
/* swap left and right buffers */
|
|
buf = rbuf; rbuf = lbuf ; lbuf = buf;
|
|
}
|
|
} else {
|
|
/* we have to send this round */
|
|
peer = rank - (1 << (r - 1));
|
|
if(firstred) {
|
|
/* we have to send the senbuf */
|
|
res = NBC_Sched_send (sendbuf, false, count, datatype, peer, schedule, false);
|
|
} else {
|
|
/* we send an already reduced value from redbuf */
|
|
res = NBC_Sched_send (lbuf, true, count, datatype, peer, schedule, false);
|
|
}
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
/* leave the game */
|
|
break;
|
|
}
|
|
}
|
|
|
|
res = NBC_Sched_barrier(schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
/* rank 0 is root and sends - all others receive */
|
|
if (rank != 0) {
|
|
res = NBC_Sched_recv (recvbuf, false, recvcount, datatype, 0, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
} else {
|
|
for (int r = 1, offset = 0 ; r < p ; ++r) {
|
|
offset += recvcount;
|
|
sbuf = lbuf + (offset*ext);
|
|
/* root sends the right buffer to the right receiver */
|
|
res = NBC_Sched_send (sbuf, true, recvcount, datatype, r, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
}
|
|
|
|
if ((p != 1) || !inplace) {
|
|
res = NBC_Sched_copy (lbuf, true, recvcount, datatype, recvbuf, false, recvcount,
|
|
datatype, schedule, false);
|
|
}
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
}
|
|
}
|
|
|
|
res = NBC_Sched_commit (schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Schedule_request(schedule, comm, libnbc_module, persistent, request, tmpbuf);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
int ompi_coll_libnbc_ireduce_scatter_block(const void* sendbuf, void* recvbuf, int recvcount, MPI_Datatype datatype,
|
|
MPI_Op op, struct ompi_communicator_t *comm, ompi_request_t ** request,
|
|
struct mca_coll_base_module_2_3_0_t *module) {
|
|
int res = nbc_reduce_scatter_block_init(sendbuf, recvbuf, recvcount, datatype, op,
|
|
comm, request, module, false);
|
|
if (OPAL_LIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
res = NBC_Start(*(ompi_coll_libnbc_request_t **)request);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
NBC_Return_handle (*(ompi_coll_libnbc_request_t **)request);
|
|
*request = &ompi_request_null.request;
|
|
return res;
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
static int nbc_reduce_scatter_block_inter_init(const void *sendbuf, void *recvbuf, int rcount, struct ompi_datatype_t *dtype,
|
|
struct ompi_op_t *op, struct ompi_communicator_t *comm, ompi_request_t **request,
|
|
struct mca_coll_base_module_2_3_0_t *module, bool persistent) {
|
|
int rank, res, count, lsize, rsize;
|
|
MPI_Aint ext;
|
|
ptrdiff_t gap, span, span_align;
|
|
NBC_Schedule *schedule;
|
|
void *tmpbuf = NULL;
|
|
ompi_coll_libnbc_module_t *libnbc_module = (ompi_coll_libnbc_module_t*) module;
|
|
|
|
rank = ompi_comm_rank (comm);
|
|
lsize = ompi_comm_size (comm);
|
|
rsize = ompi_comm_remote_size (comm);
|
|
|
|
res = ompi_datatype_type_extent (dtype, &ext);
|
|
if (MPI_SUCCESS != res) {
|
|
NBC_Error ("MPI Error in ompi_datatype_type_extent() (%i)", res);
|
|
return res;
|
|
}
|
|
|
|
count = rcount * lsize;
|
|
|
|
span = opal_datatype_span(&dtype->super, count, &gap);
|
|
span_align = OPAL_ALIGN(span, dtype->super.align, ptrdiff_t);
|
|
|
|
if (count > 0) {
|
|
tmpbuf = malloc (span_align + span);
|
|
if (NULL == tmpbuf) {
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
}
|
|
}
|
|
|
|
schedule = OBJ_NEW(NBC_Schedule);
|
|
if (NULL == schedule) {
|
|
free(tmpbuf);
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
}
|
|
|
|
/* send my data to the remote root */
|
|
res = NBC_Sched_send (sendbuf, false, count, dtype, 0, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
if (0 == rank) {
|
|
char *lbuf, *rbuf;
|
|
lbuf = (char *)(-gap);
|
|
rbuf = (char *)(span_align-gap);
|
|
res = NBC_Sched_recv (lbuf, true, count, dtype, 0, schedule, true);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
for (int peer = 1 ; peer < rsize ; ++peer) {
|
|
char *tbuf;
|
|
res = NBC_Sched_recv (rbuf, true, count, dtype, peer, schedule, true);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Sched_op (lbuf, true, rbuf, true, count, dtype,
|
|
op, schedule, true);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
tbuf = lbuf; lbuf = rbuf; rbuf = tbuf;
|
|
}
|
|
|
|
/* do the scatter with the local communicator */
|
|
res = NBC_Sched_copy (lbuf, true, rcount, dtype, recvbuf, false, rcount,
|
|
dtype, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
for (int peer = 1 ; peer < lsize ; ++peer) {
|
|
res = NBC_Sched_local_send (lbuf + ext * rcount * peer, true, rcount, dtype, peer, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
}
|
|
} else {
|
|
/* receive my block */
|
|
res = NBC_Sched_local_recv(recvbuf, false, rcount, dtype, 0, schedule, false);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
}
|
|
|
|
/*NBC_PRINT_SCHED(*schedule);*/
|
|
|
|
res = NBC_Sched_commit(schedule);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
res = NBC_Schedule_request(schedule, comm, libnbc_module, persistent, request, tmpbuf);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
OBJ_RELEASE(schedule);
|
|
free(tmpbuf);
|
|
return res;
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
int ompi_coll_libnbc_ireduce_scatter_block_inter(const void* sendbuf, void* recvbuf, int recvcount, MPI_Datatype datatype,
|
|
MPI_Op op, struct ompi_communicator_t *comm, ompi_request_t ** request,
|
|
struct mca_coll_base_module_2_3_0_t *module) {
|
|
int res = nbc_reduce_scatter_block_inter_init(sendbuf, recvbuf, recvcount, datatype, op,
|
|
comm, request, module, false);
|
|
if (OPAL_LIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
res = NBC_Start(*(ompi_coll_libnbc_request_t **)request);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
NBC_Return_handle (*(ompi_coll_libnbc_request_t **)request);
|
|
*request = &ompi_request_null.request;
|
|
return res;
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
int ompi_coll_libnbc_reduce_scatter_block_init(const void* sendbuf, void* recvbuf, int recvcount, MPI_Datatype datatype,
|
|
MPI_Op op, struct ompi_communicator_t *comm, MPI_Info info, ompi_request_t ** request,
|
|
struct mca_coll_base_module_2_3_0_t *module) {
|
|
int res = nbc_reduce_scatter_block_init(sendbuf, recvbuf, recvcount, datatype, op,
|
|
comm, request, module, true);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
int ompi_coll_libnbc_reduce_scatter_block_inter_init(const void* sendbuf, void* recvbuf, int recvcount, MPI_Datatype datatype,
|
|
MPI_Op op, struct ompi_communicator_t *comm, MPI_Info info, ompi_request_t ** request,
|
|
struct mca_coll_base_module_2_3_0_t *module) {
|
|
int res = nbc_reduce_scatter_block_inter_init(sendbuf, recvbuf, recvcount, datatype, op,
|
|
comm, request, module, true);
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
return res;
|
|
}
|
|
|
|
return OMPI_SUCCESS;
|
|
}
|