6c5532072a
OMPI and a language agnostic part in OPAL. The convertor is completely moved into OPAL. This offers several benefits as described in RFC http://www.open-mpi.org/community/lists/devel/2009/07/6387.php namely: - Fewer basic types (int* and float* types, boolean and wchar - Fixing naming scheme to ompi-nomenclature. - Usability outside of the ompi-layer. - Due to the fixed nature of simple opal types, their information is completely known at compile time and therefore constified - With fewer datatypes (22), the actual sizes of bit-field types may be reduced from 64 to 32 bits, allowing reorganizing the opal_datatype structure, eliminating holes and keeping data required in convertor (upon send/recv) in one cacheline... This has implications to the convertor-datastructure and other parts of the code. - Several performance tests have been run, the netpipe latency does not change with this patch on Linux/x86-64 on the smoky cluster. - Extensive tests have been done to verify correctness (no new regressions) using: 1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and ompi-ddt: a. running both trunk and ompi-ddt resulted in no differences (except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run correctly). b. with --enable-memchecker and running under valgrind (one buglet when run with static found in test-suite, commited) 2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt: all passed (except for the dynamic/ tests failed!! as trunk/MTT) 3. compilation and usage of HDF5 tests on Jaguar using PGI and PathScale compilers. 4. compilation and usage on Scicortex. - Please note, that for the heterogeneous case, (-m32 compiled binaries/ompi), neither ompi-trunk, nor ompi-ddt branch would successfully launch. This commit was SVN r21641.
221 строка
6.9 KiB
C
221 строка
6.9 KiB
C
/*
|
|
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
* University Research and Technology
|
|
* Corporation. All rights reserved.
|
|
* Copyright (c) 2004-2005 The University of Tennessee and The University
|
|
* of Tennessee Research Foundation. All rights
|
|
* reserved.
|
|
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
|
|
* University of Stuttgart. All rights reserved.
|
|
* Copyright (c) 2004-2005 The Regents of the University of California.
|
|
* All rights reserved.
|
|
* $COPYRIGHT$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* $HEADER$
|
|
*/
|
|
|
|
#include "ompi_config.h"
|
|
#include "coll_basic.h"
|
|
|
|
#include "mpi.h"
|
|
#include "ompi/constants.h"
|
|
#include "ompi/datatype/ompi_datatype.h"
|
|
#include "ompi/mca/coll/coll.h"
|
|
#include "ompi/mca/coll/base/coll_tags.h"
|
|
#include "ompi/mca/pml/pml.h"
|
|
|
|
|
|
/*
|
|
* alltoallw_intra
|
|
*
|
|
* Function: - MPI_Alltoallw
|
|
* Accepts: - same as MPI_Alltoallw()
|
|
* Returns: - MPI_SUCCESS or an MPI error code
|
|
*/
|
|
int
|
|
mca_coll_basic_alltoallw_intra(void *sbuf, int *scounts, int *sdisps,
|
|
struct ompi_datatype_t **sdtypes,
|
|
void *rbuf, int *rcounts, int *rdisps,
|
|
struct ompi_datatype_t **rdtypes,
|
|
struct ompi_communicator_t *comm,
|
|
mca_coll_base_module_t *module)
|
|
{
|
|
int i;
|
|
int size;
|
|
int rank;
|
|
int err;
|
|
char *psnd;
|
|
char *prcv;
|
|
int nreqs;
|
|
MPI_Request *preq;
|
|
mca_coll_basic_module_t *basic_module = (mca_coll_basic_module_t*) module;
|
|
|
|
/* Initialize. */
|
|
|
|
size = ompi_comm_size(comm);
|
|
rank = ompi_comm_rank(comm);
|
|
|
|
/* simple optimization */
|
|
|
|
psnd = ((char *) sbuf) + sdisps[rank];
|
|
prcv = ((char *) rbuf) + rdisps[rank];
|
|
|
|
if (0 != scounts[rank]) {
|
|
err = ompi_datatype_sndrcv(psnd, scounts[rank], sdtypes[rank],
|
|
prcv, rcounts[rank], rdtypes[rank]);
|
|
if (MPI_SUCCESS != err) {
|
|
return err;
|
|
}
|
|
}
|
|
|
|
/* If only one process, we're done. */
|
|
|
|
if (1 == size) {
|
|
return MPI_SUCCESS;
|
|
}
|
|
|
|
/* Initiate all send/recv to/from others. */
|
|
|
|
nreqs = 0;
|
|
preq = basic_module->mccb_reqs;
|
|
|
|
/* Post all receives first -- a simple optimization */
|
|
|
|
for (i = 0; i < size; ++i) {
|
|
if (i == rank || 0 == rcounts[i])
|
|
continue;
|
|
|
|
prcv = ((char *) rbuf) + rdisps[i];
|
|
err = MCA_PML_CALL(irecv_init(prcv, rcounts[i], rdtypes[i],
|
|
i, MCA_COLL_BASE_TAG_ALLTOALLW, comm,
|
|
preq++));
|
|
++nreqs;
|
|
if (MPI_SUCCESS != err) {
|
|
mca_coll_basic_free_reqs(basic_module->mccb_reqs,
|
|
nreqs);
|
|
return err;
|
|
}
|
|
}
|
|
|
|
/* Now post all sends */
|
|
|
|
for (i = 0; i < size; ++i) {
|
|
if (i == rank || 0 == scounts[i])
|
|
continue;
|
|
|
|
psnd = ((char *) sbuf) + sdisps[i];
|
|
err = MCA_PML_CALL(isend_init(psnd, scounts[i], sdtypes[i],
|
|
i, MCA_COLL_BASE_TAG_ALLTOALLW,
|
|
MCA_PML_BASE_SEND_STANDARD, comm,
|
|
preq++));
|
|
++nreqs;
|
|
if (MPI_SUCCESS != err) {
|
|
mca_coll_basic_free_reqs(basic_module->mccb_reqs,
|
|
nreqs);
|
|
return err;
|
|
}
|
|
}
|
|
|
|
/* Start your engines. This will never return an error. */
|
|
|
|
MCA_PML_CALL(start(nreqs, basic_module->mccb_reqs));
|
|
|
|
/* Wait for them all. If there's an error, note that we don't care
|
|
* what the error was -- just that there *was* an error. The PML
|
|
* will finish all requests, even if one or more of them fail.
|
|
* i.e., by the end of this call, all the requests are free-able.
|
|
* So free them anyway -- even if there was an error, and return the
|
|
* error after we free everything. */
|
|
|
|
err = ompi_request_wait_all(nreqs, basic_module->mccb_reqs,
|
|
MPI_STATUSES_IGNORE);
|
|
|
|
/* Free the requests. */
|
|
|
|
mca_coll_basic_free_reqs(basic_module->mccb_reqs, nreqs);
|
|
|
|
/* All done */
|
|
|
|
return MPI_SUCCESS;
|
|
}
|
|
|
|
|
|
/*
|
|
* alltoallw_inter
|
|
*
|
|
* Function: - MPI_Alltoallw
|
|
* Accepts: - same as MPI_Alltoallw()
|
|
* Returns: - MPI_SUCCESS or an MPI error code
|
|
*/
|
|
int
|
|
mca_coll_basic_alltoallw_inter(void *sbuf, int *scounts, int *sdisps,
|
|
struct ompi_datatype_t **sdtypes,
|
|
void *rbuf, int *rcounts, int *rdisps,
|
|
struct ompi_datatype_t **rdtypes,
|
|
struct ompi_communicator_t *comm,
|
|
mca_coll_base_module_t *module)
|
|
{
|
|
int i;
|
|
int size;
|
|
int err;
|
|
char *psnd;
|
|
char *prcv;
|
|
int nreqs;
|
|
MPI_Request *preq;
|
|
mca_coll_basic_module_t *basic_module = (mca_coll_basic_module_t*) module;
|
|
|
|
/* Initialize. */
|
|
size = ompi_comm_remote_size(comm);
|
|
|
|
/* Initiate all send/recv to/from others. */
|
|
nreqs = size * 2;
|
|
preq = basic_module->mccb_reqs;
|
|
|
|
/* Post all receives first -- a simple optimization */
|
|
for (i = 0; i < size; ++i) {
|
|
prcv = ((char *) rbuf) + rdisps[i];
|
|
err = MCA_PML_CALL(irecv_init(prcv, rcounts[i], rdtypes[i],
|
|
i, MCA_COLL_BASE_TAG_ALLTOALLW,
|
|
comm, preq++));
|
|
if (OMPI_SUCCESS != err) {
|
|
mca_coll_basic_free_reqs(basic_module->mccb_reqs,
|
|
nreqs);
|
|
return err;
|
|
}
|
|
}
|
|
|
|
/* Now post all sends */
|
|
for (i = 0; i < size; ++i) {
|
|
psnd = ((char *) sbuf) + sdisps[i];
|
|
err = MCA_PML_CALL(isend_init(psnd, scounts[i], sdtypes[i],
|
|
i, MCA_COLL_BASE_TAG_ALLTOALLW,
|
|
MCA_PML_BASE_SEND_STANDARD, comm,
|
|
preq++));
|
|
if (OMPI_SUCCESS != err) {
|
|
mca_coll_basic_free_reqs(basic_module->mccb_reqs,
|
|
nreqs);
|
|
return err;
|
|
}
|
|
}
|
|
|
|
/* Start your engines. This will never return an error. */
|
|
MCA_PML_CALL(start(nreqs, basic_module->mccb_reqs));
|
|
|
|
/* Wait for them all. If there's an error, note that we don't care
|
|
* what the error was -- just that there *was* an error. The PML
|
|
* will finish all requests, even if one or more of them fail.
|
|
* i.e., by the end of this call, all the requests are free-able.
|
|
* So free them anyway -- even if there was an error, and return the
|
|
* error after we free everything. */
|
|
err = ompi_request_wait_all(nreqs, basic_module->mccb_reqs,
|
|
MPI_STATUSES_IGNORE);
|
|
|
|
/* Free the requests. */
|
|
mca_coll_basic_free_reqs(basic_module->mccb_reqs, nreqs);
|
|
|
|
/* All done */
|
|
return err;
|
|
}
|