2013-10-02 18:26:23 +04:00
|
|
|
/* -*- Mode: C; c-basic-offset:4 ; 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.
|
2015-07-09 01:51:29 +03:00
|
|
|
* Copyright (c) 2013-2015 Los Alamos National Security, LLC. All rights
|
2013-10-02 18:26:23 +04:00
|
|
|
* reserved.
|
2015-08-28 10:43:13 +03:00
|
|
|
* Copyright (c) 2014-2015 Research Organization for Information Science
|
2014-10-10 10:19:37 +04:00
|
|
|
* and Technology (RIST). All rights reserved.
|
2013-10-02 18:26:23 +04:00
|
|
|
*
|
|
|
|
* Author(s): Torsten Hoefler <htor@cs.indiana.edu>
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#include "nbc_internal.h"
|
|
|
|
|
|
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
|
|
/* tree comparison function for schedule cache */
|
|
|
|
int NBC_Scan_args_compare(NBC_Scan_args *a, NBC_Scan_args *b, void *param) {
|
2015-07-09 01:51:29 +03:00
|
|
|
if ((a->sendbuf == b->sendbuf) &&
|
2013-10-02 18:26:23 +04:00
|
|
|
(a->recvbuf == b->recvbuf) &&
|
|
|
|
(a->count == b->count) &&
|
|
|
|
(a->datatype == b->datatype) &&
|
|
|
|
(a->op == b->op) ) {
|
2015-07-09 01:51:29 +03:00
|
|
|
return 0;
|
2013-10-02 18:26:23 +04:00
|
|
|
}
|
2015-07-09 01:51:29 +03:00
|
|
|
|
2013-10-02 18:26:23 +04:00
|
|
|
if( a->sendbuf < b->sendbuf ) {
|
|
|
|
return -1;
|
|
|
|
}
|
2015-07-09 01:51:29 +03:00
|
|
|
|
|
|
|
return 1;
|
2013-10-02 18:26:23 +04:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* linear iexscan
|
|
|
|
* working principle:
|
|
|
|
* 1. each node (but node 0) receives from left neigbor
|
|
|
|
* 2. performs op
|
|
|
|
* 3. all but rank p-1 do sends to it's right neigbor and exits
|
|
|
|
*
|
|
|
|
*/
|
2015-08-28 10:43:13 +03:00
|
|
|
int ompi_coll_libnbc_iexscan(const void* sendbuf, void* recvbuf, int count, MPI_Datatype datatype, MPI_Op op,
|
2013-10-02 18:26:23 +04:00
|
|
|
struct ompi_communicator_t *comm, ompi_request_t ** request,
|
2014-10-10 10:19:37 +04:00
|
|
|
struct mca_coll_base_module_2_1_0_t *module) {
|
2013-10-02 18:26:23 +04:00
|
|
|
int rank, p, res;
|
|
|
|
MPI_Aint ext;
|
|
|
|
NBC_Schedule *schedule;
|
|
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
|
|
NBC_Scan_args *args, *found, search;
|
|
|
|
#endif
|
|
|
|
char inplace;
|
|
|
|
NBC_Handle *handle;
|
|
|
|
ompi_coll_libnbc_module_t *libnbc_module = (ompi_coll_libnbc_module_t*) module;
|
|
|
|
|
|
|
|
NBC_IN_PLACE(sendbuf, recvbuf, inplace);
|
|
|
|
|
2015-07-09 01:51:29 +03:00
|
|
|
rank = ompi_comm_rank (comm);
|
|
|
|
p = ompi_comm_size (comm);
|
2013-10-02 18:26:23 +04:00
|
|
|
|
2015-11-20 07:29:02 +03:00
|
|
|
res = ompi_datatype_type_extent(datatype, &ext);
|
2015-07-09 01:51:29 +03:00
|
|
|
if (MPI_SUCCESS != res) {
|
2015-11-20 07:29:02 +03:00
|
|
|
NBC_Error("MPI Error in ompi_datatype_type_extent() (%i)", res);
|
2015-07-09 01:51:29 +03:00
|
|
|
return res;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
2015-07-09 01:51:29 +03:00
|
|
|
res = NBC_Init_handle(comm, &handle, libnbc_module);
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (inplace && rank < p - 1) {
|
2013-10-02 18:26:23 +04:00
|
|
|
/* need more buffer space for the inplace case */
|
|
|
|
handle->tmpbuf = malloc(ext * count * 2);
|
2015-07-09 01:51:29 +03:00
|
|
|
} else {
|
2013-10-02 18:26:23 +04:00
|
|
|
handle->tmpbuf = malloc(ext * count);
|
2015-07-09 01:51:29 +03:00
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
2015-07-09 01:51:29 +03:00
|
|
|
if (handle->tmpbuf == NULL) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
|
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
|
|
/* search schedule in communicator specific tree */
|
2015-07-09 01:51:29 +03:00
|
|
|
search.sendbuf = sendbuf;
|
|
|
|
search.recvbuf = recvbuf;
|
|
|
|
search.count = count;
|
|
|
|
search.datatype = datatype;
|
|
|
|
search.op = op;
|
|
|
|
found = (NBC_Scan_args *) hb_tree_search ((hb_tree *) libnbc_module->NBC_Dict[NBC_EXSCAN], &search);
|
|
|
|
if (NULL == found) {
|
2013-10-02 18:26:23 +04:00
|
|
|
#endif
|
2015-07-09 01:51:29 +03:00
|
|
|
schedule = OBJ_NEW(NBC_Schedule);
|
|
|
|
if (OPAL_UNLIKELY(NULL == schedule)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
2015-07-09 01:51:29 +03:00
|
|
|
/* make sure the schedule is released with the handle on error */
|
|
|
|
handle->schedule = schedule;
|
2013-10-02 18:26:23 +04:00
|
|
|
|
|
|
|
if (rank != 0) {
|
2015-07-09 01:51:29 +03:00
|
|
|
if (inplace && rank < p - 1) {
|
2013-10-02 18:26:23 +04:00
|
|
|
/* if sendbuf == recvbuf do not clobber the send buffer until it has been combined
|
|
|
|
* with the incoming data. */
|
2015-07-09 01:51:29 +03:00
|
|
|
res = NBC_Sched_recv ((void *) (ext * count), true, count, datatype, rank-1, schedule, false);
|
|
|
|
} else {
|
|
|
|
res = NBC_Sched_recv (recvbuf, false, count, datatype, rank-1, schedule, false);
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
2015-07-09 01:51:29 +03:00
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
|
|
|
if (rank < p - 1) {
|
|
|
|
/* we have to wait until we have the data */
|
|
|
|
res = NBC_Sched_barrier(schedule);
|
2015-07-09 01:51:29 +03:00
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
|
|
|
/* perform the reduce in my temporary buffer */
|
2015-07-09 01:51:29 +03:00
|
|
|
/* this cannot be done until handle->tmpbuf is unused :-( so barrier after */
|
|
|
|
if (inplace) {
|
|
|
|
res = NBC_Sched_op (0, true, sendbuf, false, (void *)(ext * count), true, count,
|
|
|
|
datatype, op, schedule, true);
|
|
|
|
} else {
|
|
|
|
res = NBC_Sched_op (0, true, sendbuf, false, recvbuf, false, count, datatype, op,
|
|
|
|
schedule, true);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
|
|
|
/* send reduced data onward */
|
2015-07-09 01:51:29 +03:00
|
|
|
res = NBC_Sched_send (0, true, count, datatype, rank + 1, schedule, false);
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
2015-07-09 01:51:29 +03:00
|
|
|
if (inplace) {
|
2013-10-02 18:26:23 +04:00
|
|
|
/* copy the received data into the receive buffer */
|
2015-07-09 01:51:29 +03:00
|
|
|
res = NBC_Sched_copy ((void *)(ext * count), true, count, datatype, recvbuf,
|
|
|
|
false, count, datatype, schedule, false);
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
}
|
|
|
|
} else if (p > 1) {
|
2015-07-09 01:51:29 +03:00
|
|
|
res = NBC_Sched_send (sendbuf, false, count, datatype, 1, schedule, false);
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
res = NBC_Sched_commit(schedule);
|
2015-07-09 01:51:29 +03:00
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
|
|
|
|
#ifdef NBC_CACHE_SCHEDULE
|
|
|
|
/* save schedule to tree */
|
2015-07-09 01:51:29 +03:00
|
|
|
args = (NBC_Scan_args *) malloc (sizeof (args));
|
|
|
|
if (NULL != args) {
|
|
|
|
args->sendbuf = sendbuf;
|
|
|
|
args->recvbuf = recvbuf;
|
|
|
|
args->count = count;
|
|
|
|
args->datatype = datatype;
|
|
|
|
args->op = op;
|
|
|
|
args->schedule = schedule;
|
|
|
|
res = hb_tree_insert ((hb_tree *) libnbc_module->NBC_Dict[NBC_EXSCAN], args, args, 0);
|
|
|
|
if (0 == res) {
|
|
|
|
OBJ_RETAIN(schedule);
|
|
|
|
|
|
|
|
/* increase number of elements for A2A */
|
|
|
|
if (++libnbc_module->NBC_Dict_size[NBC_EXSCAN] > NBC_SCHED_DICT_UPPER) {
|
|
|
|
NBC_SchedCache_dictwipe ((hb_tree *) libnbc_module->NBC_Dict[NBC_EXSCAN],
|
|
|
|
&libnbc_module->NBC_Dict_size[NBC_EXSCAN]);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
NBC_Error("error in dict_insert() (%i)", res);
|
|
|
|
free (args);
|
|
|
|
}
|
2013-10-02 18:26:23 +04:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* found schedule */
|
2015-07-09 01:51:29 +03:00
|
|
|
schedule = found->schedule;
|
|
|
|
OBJ_RETAIN(schedule);
|
2013-10-02 18:26:23 +04:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-07-09 01:51:29 +03:00
|
|
|
res = NBC_Start (handle, schedule);
|
|
|
|
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
|
|
|
|
NBC_Return_handle (handle);
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
*request = (ompi_request_t *) handle;
|
2013-10-02 18:26:23 +04:00
|
|
|
|
|
|
|
/* tmpbuf is freed with the handle */
|
2015-07-09 01:51:29 +03:00
|
|
|
return OMPI_SUCCESS;
|
2013-10-02 18:26:23 +04:00
|
|
|
}
|