1
1
openmpi/ompi/mca/coll/libnbc/nbc_ineighbor_allgatherv.c

171 строка
5.1 KiB
C
Исходник Обычный вид История

2015-07-09 01:51:29 +03:00
/* -*- Mode: C; c-basic-offset:2 ; indent-tabs-mode:nil -*- */
/*
2014-10-10 10:19:37 +04:00
* 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) 2014 Research Organization for Information Science
* and Technology (RIST). All rights reserved.
2015-07-09 01:51:29 +03:00
* Copyright (c) 2015 Los Alamos National Security, LLC. All rights
* reserved.
*
* Author(s): Torsten Hoefler <htor@cs.indiana.edu>
*
*/
#include "nbc_internal.h"
/* cannot cache schedules because one cannot check locally if the pattern is the same!! */
#undef NBC_CACHE_SCHEDULE
#ifdef NBC_CACHE_SCHEDULE
/* tree comparison function for schedule cache */
int NBC_Ineighbor_allgatherv_args_compare(NBC_Ineighbor_allgatherv_args *a, NBC_Ineighbor_allgatherv_args *b, void *param) {
2015-07-09 01:51:29 +03:00
if ((a->sbuf == b->sbuf) &&
(a->scount == b->scount) &&
(a->stype == b->stype) &&
(a->rbuf == b->rbuf) &&
(a->rcount == b->rcount) &&
(a->rtype == b->rtype) ) {
2015-07-09 01:51:29 +03:00
return 0;
}
2015-07-09 01:51:29 +03:00
if( a->sbuf < b->sbuf ) {
return -1;
}
2015-07-09 01:51:29 +03:00
return 1;
}
#endif
int ompi_coll_libnbc_ineighbor_allgatherv(void *sbuf, int scount, MPI_Datatype stype, void *rbuf,
int *rcounts, int *displs, MPI_Datatype rtype,
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) {
2015-07-09 01:51:29 +03:00
int res, indegree, outdegree, *srcs, *dsts;
MPI_Aint rcvext;
NBC_Handle *handle;
ompi_coll_libnbc_module_t *libnbc_module = (ompi_coll_libnbc_module_t*) module;
2015-07-09 01:51:29 +03:00
NBC_Schedule *schedule;
res = MPI_Type_extent(rtype, &rcvext);
2015-07-09 01:51:29 +03:00
if (MPI_SUCCESS != res) {
NBC_Error("MPI Error in MPI_Type_extent() (%i)", res);
return res;
}
#ifdef NBC_CACHE_SCHEDULE
NBC_Ineighbor_allgatherv_args *args, *found, search;
/* search schedule in communicator specific tree */
2015-07-09 01:51:29 +03:00
search.sbuf = sbuf;
search.scount = scount;
search.stype = stype;
search.rbuf = rbuf;
search.rcount = rcount;
search.rtype = rtype;
found = (NBC_Ineighbor_allgatherv_args *) hb_tree_search ((hb_tree *) libnbc_module->NBC_Dict[NBC_NEIGHBOR_ALLGATHERV],
&search);
if (NULL == found) {
#endif
2015-07-09 01:51:29 +03:00
schedule = OBJ_NEW(NBC_Schedule);
if (OPAL_UNLIKELY(NULL == schedule)) {
return OMPI_ERR_OUT_OF_RESOURCE;
}
res = NBC_Comm_neighbors(comm, &srcs, &indegree, &dsts, &outdegree);
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
OBJ_RELEASE(schedule);
return res;
}
/* simply loop over neighbors and post send/recv operations */
for (int i = 0 ; i < indegree ; ++i) {
if (srcs[i] != MPI_PROC_NULL) {
res = NBC_Sched_recv ((char *) rbuf + displs[i] * rcvext, false, rcounts[i], rtype, srcs[i], schedule, false);
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
break;
}
2015-07-09 01:51:29 +03:00
}
}
free (srcs);
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
free (dsts);
OBJ_RELEASE(schedule);
return res;
}
for (int i = 0 ; i < outdegree ; ++i) {
if (dsts[i] != MPI_PROC_NULL) {
res = NBC_Sched_send ((char *) sbuf, false, scount, stype, dsts[i], schedule, false);
if (OPAL_UNLIKELY(OMPI_SUCCESS != res)) {
break;
}
}
}
2015-07-09 01:51:29 +03:00
free (dsts);
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;
}
#ifdef NBC_CACHE_SCHEDULE
/* save schedule to tree */
2015-07-09 01:51:29 +03:00
args = (NBC_Ineighbor_allgatherv_args *) malloc (sizeof (args));
if (NULL != args) {
args->sbuf = sbuf;
args->scount = scount;
args->stype = stype;
args->rbuf = rbuf;
args->rcount = rcount;
args->rtype = rtype;
args->schedule = schedule;
res = hb_tree_insert ((hb_tree *) libnbc_module->NBC_Dict[NBC_NEIGHBOR_ALLGATHERV], args, args, 0);
if (0 == res) {
OBJ_RETAIN(schedule);
/* increase number of elements for A2A */
if(++libnbc_module->NBC_Dict_size[NBC_NEIGHBOR_ALLGATHERV] > NBC_SCHED_DICT_UPPER) {
NBC_SchedCache_dictwipe ((hb_tree *) libnbc_module->NBC_Dict[NBC_NEIGHBOR_ALLGATHERV],
&libnbc_module->NBC_Dict_size[NBC_NEIGHBOR_ALLGATHERV]);
}
} else {
NBC_Error("error in dict_insert() (%i)", res);
free (args);
}
}
} else {
/* found schedule */
2015-07-09 01:51:29 +03:00
schedule = found->schedule;
OBJ_RETAIN(schedule);
}
#endif
2015-07-09 01:51:29 +03:00
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);
OBJ_RELEASE(schedule);
return OMPI_ERR_OUT_OF_RESOURCE;
}
*request = (ompi_request_t *) handle;
2015-07-09 01:51:29 +03:00
return OMPI_SUCCESS;
}