e7ecd56bd2
such, the commit message back to the master SVN repository is fairly long. = ORTE Job-Level Output Messages = Add two new interfaces that should be used for all new code throughout the ORTE and OMPI layers (we already make the search-and-replace on the existing ORTE / OMPI layers): * orte_output(): (and corresponding friends ORTE_OUTPUT, orte_output_verbose, etc.) This function sends the output directly to the HNP for processing as part of a job-specific output channel. It supports all the same outputs as opal_output() (syslog, file, stdout, stderr), but for stdout/stderr, the output is sent to the HNP for processing and output. More on this below. * orte_show_help(): This function is a drop-in-replacement for opal_show_help(), with two differences in functionality: 1. the rendered text help message output is sent to the HNP for display (rather than outputting directly into the process' stderr stream) 1. the HNP detects duplicate help messages and does not display them (so that you don't see the same error message N times, once from each of your N MPI processes); instead, it counts "new" instances of the help message and displays a message every ~5 seconds when there are new ones ("I got X new copies of the help message...") opal_show_help and opal_output still exist, but they only output in the current process. The intent for the new orte_* functions is that they can apply job-level intelligence to the output. As such, we recommend that all new ORTE and OMPI code use the new orte_* functions, not thei opal_* functions. === New code === For ORTE and OMPI programmers, here's what you need to do differently in new code: * Do not include opal/util/show_help.h or opal/util/output.h. Instead, include orte/util/output.h (this one header file has declarations for both the orte_output() series of functions and orte_show_help()). * Effectively s/opal_output/orte_output/gi throughout your code. Note that orte_output_open() takes a slightly different argument list (as a way to pass data to the filtering stream -- see below), so you if explicitly call opal_output_open(), you'll need to slightly adapt to the new signature of orte_output_open(). * Literally s/opal_show_help/orte_show_help/. The function signature is identical. === Notes === * orte_output'ing to stream 0 will do similar to what opal_output'ing did, so leaving a hard-coded "0" as the first argument is safe. * For systems that do not use ORTE's RML or the HNP, the effect of orte_output_* and orte_show_help will be identical to their opal counterparts (the additional information passed to orte_output_open() will be lost!). Indeed, the orte_* functions simply become trivial wrappers to their opal_* counterparts. Note that we have not tested this; the code is simple but it is quite possible that we mucked something up. = Filter Framework = Messages sent view the new orte_* functions described above and messages output via the IOF on the HNP will now optionally be passed through a new "filter" framework before being output to stdout/stderr. The "filter" OPAL MCA framework is intended to allow preprocessing to messages before they are sent to their final destinations. The first component that was written in the filter framework was to create an XML stream, segregating all the messages into different XML tags, etc. This will allow 3rd party tools to read the stdout/stderr from the HNP and be able to know exactly what each text message is (e.g., a help message, another OMPI infrastructure message, stdout from the user process, stderr from the user process, etc.). Filtering is not active by default. Filter components must be specifically requested, such as: {{{ $ mpirun --mca filter xml ... }}} There can only be one filter component active. = New MCA Parameters = The new functionality described above introduces two new MCA parameters: * '''orte_base_help_aggregate''': Defaults to 1 (true), meaning that help messages will be aggregated, as described above. If set to 0, all help messages will be displayed, even if they are duplicates (i.e., the original behavior). * '''orte_base_show_output_recursions''': An MCA parameter to help debug one of the known issues, described below. It is likely that this MCA parameter will disappear before v1.3 final. = Known Issues = * The XML filter component is not complete. The current output from this component is preliminary and not real XML. A bit more work needs to be done to configure.m4 search for an appropriate XML library/link it in/use it at run time. * There are possible recursion loops in the orte_output() and orte_show_help() functions -- e.g., if RML send calls orte_output() or orte_show_help(). We have some ideas how to fix these, but figured that it was ok to commit before feature freeze with known issues. The code currently contains sub-optimal workarounds so that this will not be a problem, but it would be good to actually solve the problem rather than have hackish workarounds before v1.3 final. This commit was SVN r18434.
732 строки
29 KiB
C
732 строки
29 KiB
C
/*
|
|
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
* University Research and Technology
|
|
* Corporation. All rights reserved.
|
|
* Copyright (c) 2004-2006 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 "mpi.h"
|
|
#include "ompi/constants.h"
|
|
#include "ompi/datatype/datatype.h"
|
|
#include "ompi/communicator/communicator.h"
|
|
#include "ompi/mca/coll/coll.h"
|
|
#include "ompi/mca/coll/base/coll_tags.h"
|
|
#include "ompi/mca/pml/pml.h"
|
|
#include "ompi/op/op.h"
|
|
#include "coll_tuned.h"
|
|
#include "coll_tuned_topo.h"
|
|
#include "coll_tuned_util.h"
|
|
|
|
int ompi_coll_tuned_alltoall_intra_pairwise(void *sbuf, int scount,
|
|
struct ompi_datatype_t *sdtype,
|
|
void* rbuf, int rcount,
|
|
struct ompi_datatype_t *rdtype,
|
|
struct ompi_communicator_t *comm,
|
|
struct mca_coll_base_module_1_1_0_t *module)
|
|
{
|
|
int line = -1, err = 0;
|
|
int rank, size, step;
|
|
int sendto, recvfrom;
|
|
void * tmpsend, *tmprecv;
|
|
ptrdiff_t lb, sext, rext;
|
|
|
|
size = ompi_comm_size(comm);
|
|
rank = ompi_comm_rank(comm);
|
|
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"coll:tuned:alltoall_intra_pairwise rank %d", rank));
|
|
|
|
err = ompi_ddt_get_extent (sdtype, &lb, &sext);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
err = ompi_ddt_get_extent (rdtype, &lb, &rext);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
|
|
/* Perform pairwise exchange - starting from 1 so the local copy is last */
|
|
for (step = 1; step < size + 1; step++) {
|
|
|
|
/* Determine sender and receiver for this step. */
|
|
sendto = (rank + step) % size;
|
|
recvfrom = (rank + size - step) % size;
|
|
|
|
/* Determine sending and receiving locations */
|
|
tmpsend = (char*)sbuf + sendto * sext * scount;
|
|
tmprecv = (char*)rbuf + recvfrom * rext * rcount;
|
|
|
|
/* send and receive */
|
|
err = ompi_coll_tuned_sendrecv( tmpsend, scount, sdtype, sendto,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
tmprecv, rcount, rdtype, recvfrom,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
comm, MPI_STATUS_IGNORE, rank);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
}
|
|
|
|
return MPI_SUCCESS;
|
|
|
|
err_hndl:
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"%s:%4d\tError occurred %d, rank %2d", __FILE__, line,
|
|
err, rank));
|
|
return err;
|
|
}
|
|
|
|
|
|
int ompi_coll_tuned_alltoall_intra_bruck(void *sbuf, int scount,
|
|
struct ompi_datatype_t *sdtype,
|
|
void* rbuf, int rcount,
|
|
struct ompi_datatype_t *rdtype,
|
|
struct ompi_communicator_t *comm,
|
|
struct mca_coll_base_module_1_1_0_t *module)
|
|
{
|
|
int i, k, line = -1;
|
|
int rank, size;
|
|
int sendto, recvfrom, distance, *displs = NULL, *blen = NULL;
|
|
char *tmpbuf = NULL, *tmpbuf_free = NULL;
|
|
ptrdiff_t rlb, slb, tlb, sext, rext, tsext;
|
|
int err = 0;
|
|
int weallocated = 0;
|
|
struct ompi_datatype_t *new_ddt;
|
|
#ifdef blahblah
|
|
mca_coll_tuned_module_t *tuned_module = (mca_coll_tuned_module_t*) module;
|
|
mca_coll_tuned_comm_t *data = tuned_module->tuned_data;
|
|
#endif
|
|
|
|
size = ompi_comm_size(comm);
|
|
rank = ompi_comm_rank(comm);
|
|
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"coll:tuned:alltoall_intra_bruck rank %d", rank));
|
|
|
|
err = ompi_ddt_get_extent (sdtype, &slb, &sext);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
err = ompi_ddt_get_true_extent(sdtype, &tlb, &tsext);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
err = ompi_ddt_get_extent (rdtype, &rlb, &rext);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
|
|
#ifdef blahblah
|
|
/* try and SAVE memory by using the data segment hung off
|
|
the communicator if possible */
|
|
if (data->mcct_num_reqs >= size) {
|
|
/* we have enought preallocated for displments and lengths */
|
|
displs = (int*) data->mcct_reqs;
|
|
blen = (int *) (displs + size);
|
|
weallocated = 0;
|
|
}
|
|
else { /* allocate the buffers ourself */
|
|
#endif
|
|
displs = (int *) malloc(size * sizeof(int));
|
|
if (displs == NULL) { line = __LINE__; err = -1; goto err_hndl; }
|
|
blen = (int *) malloc(size * sizeof(int));
|
|
if (blen == NULL) { line = __LINE__; err = -1; goto err_hndl; }
|
|
weallocated = 1;
|
|
#ifdef blahblah
|
|
}
|
|
#endif
|
|
|
|
/* tmp buffer allocation for message data */
|
|
tmpbuf_free = (char *) malloc(tsext + (scount * size - 1) * sext);
|
|
if (tmpbuf_free == NULL) { line = __LINE__; err = -1; goto err_hndl; }
|
|
tmpbuf = tmpbuf_free - slb;
|
|
|
|
/* Step 1 - local rotation - shift up by rank */
|
|
err = ompi_ddt_copy_content_same_ddt (sdtype,
|
|
(int32_t) ((size - rank) * scount),
|
|
tmpbuf,
|
|
((char*) sbuf) + rank * scount * sext);
|
|
if (err<0) {
|
|
line = __LINE__; err = -1; goto err_hndl;
|
|
}
|
|
|
|
if (rank != 0) {
|
|
err = ompi_ddt_copy_content_same_ddt (sdtype, (int32_t) (rank * scount),
|
|
tmpbuf + (size - rank) * scount* sext,
|
|
(char*) sbuf);
|
|
if (err<0) {
|
|
line = __LINE__; err = -1; goto err_hndl;
|
|
}
|
|
}
|
|
|
|
/* perform communication step */
|
|
for (distance = 1; distance < size; distance<<=1) {
|
|
|
|
sendto = (rank + distance) % size;
|
|
recvfrom = (rank - distance + size) % size;
|
|
k = 0;
|
|
|
|
/* create indexed datatype */
|
|
for (i = 1; i < size; i++) {
|
|
if (( i & distance) == distance) {
|
|
displs[k] = i * scount;
|
|
blen[k] = scount;
|
|
k++;
|
|
}
|
|
}
|
|
/* Set indexes and displacements */
|
|
err = ompi_ddt_create_indexed(k, blen, displs, sdtype, &new_ddt);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
/* Commit the new datatype */
|
|
err = ompi_ddt_commit(&new_ddt);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
/* Sendreceive */
|
|
err = ompi_coll_tuned_sendrecv ( tmpbuf, 1, new_ddt, sendto,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
rbuf, 1, new_ddt, recvfrom,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
comm, MPI_STATUS_IGNORE, rank );
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
/* Copy back new data from recvbuf to tmpbuf */
|
|
err = ompi_ddt_copy_content_same_ddt(new_ddt, 1,tmpbuf, (char *) rbuf);
|
|
if (err < 0) { line = __LINE__; err = -1; goto err_hndl; }
|
|
|
|
/* free ddt */
|
|
err = ompi_ddt_destroy(&new_ddt);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
} /* end of for (distance = 1... */
|
|
|
|
/* Step 3 - local rotation - */
|
|
for (i = 0; i < size; i++) {
|
|
|
|
err = ompi_ddt_copy_content_same_ddt (rdtype, (int32_t) rcount,
|
|
((char*)rbuf) + (((rank - i + size) % size) * rcount * rext),
|
|
tmpbuf + i * rcount * rext);
|
|
if (err < 0) { line = __LINE__; err = -1; goto err_hndl; }
|
|
}
|
|
|
|
/* Step 4 - clean up */
|
|
if (tmpbuf != NULL) free(tmpbuf_free);
|
|
if (weallocated) {
|
|
if (displs != NULL) free(displs);
|
|
if (blen != NULL) free(blen);
|
|
}
|
|
return OMPI_SUCCESS;
|
|
|
|
err_hndl:
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"%s:%4d\tError occurred %d, rank %2d", __FILE__, line, err,
|
|
rank));
|
|
if (tmpbuf != NULL) free(tmpbuf_free);
|
|
if (weallocated) {
|
|
if (displs != NULL) free(displs);
|
|
if (blen != NULL) free(blen);
|
|
}
|
|
return err;
|
|
}
|
|
|
|
/*
|
|
* alltoall_intra_linear_sync
|
|
*
|
|
* Function: Linear implementation of alltoall with limited number
|
|
* of outstanding requests.
|
|
* Accepts: Same as MPI_Alltoall(), and the maximum number of
|
|
* outstanding requests (actual number is 2 * max, since
|
|
* we count receive and send requests separately).
|
|
* Returns: MPI_SUCCESS or error code
|
|
*
|
|
* Description: Algorithm is the following:
|
|
* 1) post K irecvs, K <= N
|
|
* 2) post K isends, K <= N
|
|
* 3) while not done
|
|
* - wait for any request to complete
|
|
* - replace that request by the new one of the same type.
|
|
*/
|
|
int ompi_coll_tuned_alltoall_intra_linear_sync(void *sbuf, int scount,
|
|
struct ompi_datatype_t *sdtype,
|
|
void* rbuf, int rcount,
|
|
struct ompi_datatype_t *rdtype,
|
|
struct ompi_communicator_t *comm,
|
|
struct mca_coll_base_module_1_1_0_t *module,
|
|
int max_outstanding_reqs)
|
|
{
|
|
int line, error;
|
|
int ri, si;
|
|
int rank;
|
|
int size;
|
|
int nreqs, nrreqs, nsreqs, total_reqs;
|
|
char *psnd;
|
|
char *prcv;
|
|
ptrdiff_t slb, sext;
|
|
ptrdiff_t rlb, rext;
|
|
|
|
ompi_request_t **reqs = NULL;
|
|
|
|
/* Initialize. */
|
|
|
|
size = ompi_comm_size(comm);
|
|
rank = ompi_comm_rank(comm);
|
|
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"ompi_coll_tuned_alltoall_intra_linear_sync rank %d", rank));
|
|
|
|
|
|
error = ompi_ddt_get_extent(sdtype, &slb, &sext);
|
|
if (OMPI_SUCCESS != error) {
|
|
return error;
|
|
}
|
|
sext *= scount;
|
|
|
|
error = ompi_ddt_get_extent(rdtype, &rlb, &rext);
|
|
if (OMPI_SUCCESS != error) {
|
|
return error;
|
|
}
|
|
rext *= rcount;
|
|
|
|
/* simple optimization */
|
|
|
|
psnd = ((char *) sbuf) + (rank * sext);
|
|
prcv = ((char *) rbuf) + (rank * rext);
|
|
|
|
error = ompi_ddt_sndrcv(psnd, scount, sdtype, prcv, rcount, rdtype);
|
|
if (MPI_SUCCESS != error) {
|
|
return error;
|
|
}
|
|
|
|
/* If only one process, we're done. */
|
|
|
|
if (1 == size) {
|
|
return MPI_SUCCESS;
|
|
}
|
|
|
|
/* Initiate send/recv to/from others. */
|
|
total_reqs = (((max_outstanding_reqs > (size - 1)) ||
|
|
(max_outstanding_reqs <= 0)) ?
|
|
(size - 1) : (max_outstanding_reqs));
|
|
reqs = (ompi_request_t**) malloc( 2 * total_reqs *
|
|
sizeof(ompi_request_t*));
|
|
if (NULL == reqs) { error = -1; goto error_hndl; }
|
|
|
|
prcv = (char *) rbuf;
|
|
psnd = (char *) sbuf;
|
|
|
|
/* Post first batch or ireceive and isend requests */
|
|
for (nreqs = 0, nrreqs = 0, ri = (rank + 1) % size; nreqs < total_reqs;
|
|
ri = (ri + 1) % size, ++nreqs, ++nrreqs) {
|
|
error =
|
|
MCA_PML_CALL(irecv
|
|
(prcv + (ri * rext), rcount, rdtype, ri,
|
|
MCA_COLL_BASE_TAG_ALLTOALL, comm, &reqs[nreqs]));
|
|
if (MPI_SUCCESS != error) { line = __LINE__; goto error_hndl; }
|
|
}
|
|
for ( nsreqs = 0, si = (rank + size - 1) % size; nreqs < 2 * total_reqs;
|
|
si = (si + size - 1) % size, ++nreqs, ++nsreqs) {
|
|
error =
|
|
MCA_PML_CALL(isend
|
|
(psnd + (si * sext), scount, sdtype, si,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
MCA_PML_BASE_SEND_STANDARD, comm, &reqs[nreqs]));
|
|
if (MPI_SUCCESS != error) { line = __LINE__; goto error_hndl; }
|
|
}
|
|
|
|
/* Wait for requests to complete */
|
|
if (nreqs == 2 * (size - 1)) {
|
|
/* Optimization for the case when all requests have been posted */
|
|
error = ompi_request_wait_all(nreqs, reqs, MPI_STATUSES_IGNORE);
|
|
if (MPI_SUCCESS != error) { line = __LINE__; goto error_hndl; }
|
|
|
|
} else {
|
|
/* As requests complete, replace them with corresponding requests:
|
|
- wait for any request to complete, mark the request as
|
|
MPI_REQUEST_NULL
|
|
- If it was a receive request, replace it with new irecv request
|
|
(if any)
|
|
- if it was a send request, replace it with new isend request (if any)
|
|
*/
|
|
int ncreqs = 0;
|
|
while (ncreqs < 2 * (size - 1)) {
|
|
int completed;
|
|
error = ompi_request_wait_any(2 * total_reqs, reqs, &completed,
|
|
MPI_STATUS_IGNORE);
|
|
if (MPI_SUCCESS != error) { line = __LINE__; goto error_hndl; }
|
|
reqs[completed] = MPI_REQUEST_NULL;
|
|
ncreqs++;
|
|
if (completed < total_reqs) {
|
|
if (nrreqs < (size - 1)) {
|
|
error =
|
|
MCA_PML_CALL(irecv
|
|
(prcv + (ri * rext), rcount, rdtype, ri,
|
|
MCA_COLL_BASE_TAG_ALLTOALL, comm,
|
|
&reqs[completed]));
|
|
if (MPI_SUCCESS != error) { line = __LINE__; goto error_hndl; }
|
|
++nrreqs;
|
|
ri = (ri + 1) % size;
|
|
}
|
|
} else {
|
|
if (nsreqs < (size - 1)) {
|
|
error = MCA_PML_CALL(isend
|
|
(psnd + (si * sext), scount, sdtype, si,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
MCA_PML_BASE_SEND_STANDARD, comm,
|
|
&reqs[completed]));
|
|
++nsreqs;
|
|
si = (si + size - 1) % size;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Free the reqs */
|
|
free(reqs);
|
|
|
|
/* All done */
|
|
return MPI_SUCCESS;
|
|
|
|
error_hndl:
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"%s:%4d\tError occurred %d, rank %2d", __FILE__, line, error,
|
|
rank));
|
|
if (NULL != reqs) free(reqs);
|
|
return error;
|
|
}
|
|
|
|
|
|
int ompi_coll_tuned_alltoall_intra_two_procs(void *sbuf, int scount,
|
|
struct ompi_datatype_t *sdtype,
|
|
void* rbuf, int rcount,
|
|
struct ompi_datatype_t *rdtype,
|
|
struct ompi_communicator_t *comm,
|
|
struct mca_coll_base_module_1_1_0_t *module)
|
|
{
|
|
int line = -1, err = 0;
|
|
int rank;
|
|
int remote;
|
|
void * tmpsend, *tmprecv;
|
|
ptrdiff_t sext, rext, lb;
|
|
|
|
rank = ompi_comm_rank(comm);
|
|
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"ompi_coll_tuned_alltoall_intra_two_procs rank %d", rank));
|
|
|
|
err = ompi_ddt_get_extent (sdtype, &lb, &sext);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
err = ompi_ddt_get_extent (rdtype, &lb, &rext);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
/* exchange data */
|
|
remote = rank ^ 1;
|
|
|
|
tmpsend = (char*)sbuf + remote * sext * scount;
|
|
tmprecv = (char*)rbuf + remote * rext * rcount;
|
|
|
|
/* send and receive */
|
|
err = ompi_coll_tuned_sendrecv ( tmpsend, scount, sdtype, remote,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
tmprecv, rcount, rdtype, remote,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
comm, MPI_STATUS_IGNORE, rank );
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
/* ddt sendrecv your own data */
|
|
err = ompi_ddt_sndrcv((char*) sbuf + rank * sext * scount,
|
|
(int32_t) scount, sdtype,
|
|
(char*) rbuf + rank * rext * rcount,
|
|
(int32_t) rcount, rdtype);
|
|
if (err != MPI_SUCCESS) { line = __LINE__; goto err_hndl; }
|
|
|
|
/* done */
|
|
return MPI_SUCCESS;
|
|
|
|
err_hndl:
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"%s:%4d\tError occurred %d, rank %2d", __FILE__, line, err,
|
|
rank));
|
|
return err;
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
* Linear functions are copied from the BASIC coll module
|
|
* they do not segment the message and are simple implementations
|
|
* but for some small number of nodes and/or small data sizes they
|
|
* are just as fast as tuned/tree based segmenting operations
|
|
* and as such may be selected by the decision functions
|
|
* These are copied into this module due to the way we select modules
|
|
* in V1. i.e. in V2 we will handle this differently and so will not
|
|
* have to duplicate code.
|
|
* GEF Oct05 after asking Jeff.
|
|
*/
|
|
|
|
/* copied function (with appropriate renaming) starts here */
|
|
|
|
int ompi_coll_tuned_alltoall_intra_basic_linear(void *sbuf, int scount,
|
|
struct ompi_datatype_t *sdtype,
|
|
void* rbuf, int rcount,
|
|
struct ompi_datatype_t *rdtype,
|
|
struct ompi_communicator_t *comm,
|
|
struct mca_coll_base_module_1_1_0_t *module)
|
|
{
|
|
int i;
|
|
int rank;
|
|
int size;
|
|
int err;
|
|
int nreqs;
|
|
char *psnd;
|
|
char *prcv;
|
|
MPI_Aint lb;
|
|
MPI_Aint sndinc;
|
|
MPI_Aint rcvinc;
|
|
|
|
ompi_request_t **req;
|
|
ompi_request_t **sreq;
|
|
ompi_request_t **rreq;
|
|
|
|
mca_coll_tuned_module_t *tuned_module = (mca_coll_tuned_module_t*) module;
|
|
mca_coll_tuned_comm_t *data = tuned_module->tuned_data;
|
|
|
|
/* Initialize. */
|
|
|
|
size = ompi_comm_size(comm);
|
|
rank = ompi_comm_rank(comm);
|
|
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,
|
|
"ompi_coll_tuned_alltoall_intra_basic_linear rank %d", rank));
|
|
|
|
|
|
err = ompi_ddt_get_extent(sdtype, &lb, &sndinc);
|
|
if (OMPI_SUCCESS != err) {
|
|
return err;
|
|
}
|
|
sndinc *= scount;
|
|
|
|
err = ompi_ddt_get_extent(rdtype, &lb, &rcvinc);
|
|
if (OMPI_SUCCESS != err) {
|
|
return err;
|
|
}
|
|
rcvinc *= rcount;
|
|
|
|
/* simple optimization */
|
|
|
|
psnd = ((char *) sbuf) + (rank * sndinc);
|
|
prcv = ((char *) rbuf) + (rank * rcvinc);
|
|
|
|
err = ompi_ddt_sndrcv(psnd, scount, sdtype, prcv, rcount, rdtype);
|
|
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. */
|
|
|
|
req = rreq = data->mcct_reqs;
|
|
sreq = rreq + size - 1;
|
|
|
|
prcv = (char *) rbuf;
|
|
psnd = (char *) sbuf;
|
|
|
|
/* Post all receives first -- a simple optimization */
|
|
|
|
for (nreqs = 0, i = (rank + 1) % size; i != rank;
|
|
i = (i + 1) % size, ++rreq, ++nreqs) {
|
|
err =
|
|
MCA_PML_CALL(irecv_init
|
|
(prcv + (i * rcvinc), rcount, rdtype, i,
|
|
MCA_COLL_BASE_TAG_ALLTOALL, comm, rreq));
|
|
if (MPI_SUCCESS != err) {
|
|
ompi_coll_tuned_free_reqs(req, rreq - req);
|
|
return err;
|
|
}
|
|
}
|
|
|
|
/* Now post all sends in reverse order
|
|
- We would like to minimize the search time through message queue
|
|
when messages actually arrive in the order in which they were posted.
|
|
*/
|
|
for (nreqs = 0, i = (rank + size - 1) % size; i != rank;
|
|
i = (i + size - 1) % size, ++sreq, ++nreqs) {
|
|
err =
|
|
MCA_PML_CALL(isend_init
|
|
(psnd + (i * sndinc), scount, sdtype, i,
|
|
MCA_COLL_BASE_TAG_ALLTOALL,
|
|
MCA_PML_BASE_SEND_STANDARD, comm, sreq));
|
|
if (MPI_SUCCESS != err) {
|
|
ompi_coll_tuned_free_reqs(req, sreq - req);
|
|
return err;
|
|
}
|
|
}
|
|
|
|
nreqs = (size - 1) * 2;
|
|
/* Start your engines. This will never return an error. */
|
|
|
|
MCA_PML_CALL(start(nreqs, req));
|
|
|
|
/* 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, req, MPI_STATUSES_IGNORE);
|
|
|
|
/* Free the reqs */
|
|
|
|
ompi_coll_tuned_free_reqs(req, nreqs);
|
|
|
|
/* All done */
|
|
|
|
return err;
|
|
}
|
|
|
|
/* copied function (with appropriate renaming) ends here */
|
|
|
|
/* The following are used by dynamic and forced rules */
|
|
|
|
/* publish details of each algorithm and if its forced/fixed/locked in */
|
|
/* as you add methods/algorithms you must update this and the query/map routines */
|
|
|
|
/* this routine is called by the component only */
|
|
/* this makes sure that the mca parameters are set to their initial values and perms */
|
|
/* module does not call this they call the forced_getvalues routine instead */
|
|
|
|
int ompi_coll_tuned_alltoall_intra_check_forced_init (coll_tuned_force_algorithm_mca_param_indices_t *mca_param_indices)
|
|
{
|
|
int max_alg = 5, requested_alg, max_requests;
|
|
|
|
ompi_coll_tuned_forced_max_algorithms[ALLTOALL] = max_alg;
|
|
|
|
mca_base_param_reg_int (&mca_coll_tuned_component.super.collm_version,
|
|
"alltoall_algorithm_count",
|
|
"Number of alltoall algorithms available",
|
|
false, true, max_alg, NULL);
|
|
|
|
mca_param_indices->algorithm_param_index
|
|
= mca_base_param_reg_int(&mca_coll_tuned_component.super.collm_version,
|
|
"alltoall_algorithm",
|
|
"Which alltoall algorithm is used. Can be locked down to choice of: 0 ignore, 1 basic linear, 2 pairwise, 3: modified bruck, 4: linear with sync, 5:two proc only.",
|
|
false, false, 0, NULL);
|
|
mca_base_param_lookup_int(mca_param_indices->algorithm_param_index, &(requested_alg));
|
|
if( requested_alg > max_alg ) {
|
|
if( 0 == ompi_comm_rank( MPI_COMM_WORLD ) ) {
|
|
orte_output( 0, "Alltoall algorithm #%d is not available (range [0..%d]). Switching back to ignore(0)\n",
|
|
requested_alg, max_alg );
|
|
}
|
|
mca_base_param_set_int( mca_param_indices->algorithm_param_index, 0);
|
|
}
|
|
|
|
mca_param_indices->segsize_param_index
|
|
= mca_base_param_reg_int(&mca_coll_tuned_component.super.collm_version,
|
|
"alltoall_algorithm_segmentsize",
|
|
"Segment size in bytes used by default for alltoall algorithms. Only has meaning if algorithm is forced and supports segmenting. 0 bytes means no segmentation.",
|
|
false, false, 0, NULL);
|
|
|
|
mca_param_indices->tree_fanout_param_index
|
|
= mca_base_param_reg_int(&mca_coll_tuned_component.super.collm_version,
|
|
"alltoall_algorithm_tree_fanout",
|
|
"Fanout for n-tree used for alltoall algorithms. Only has meaning if algorithm is forced and supports n-tree topo based operation.",
|
|
false, false,
|
|
ompi_coll_tuned_init_tree_fanout, /* get system wide default */
|
|
NULL);
|
|
|
|
mca_param_indices->chain_fanout_param_index
|
|
= mca_base_param_reg_int(&mca_coll_tuned_component.super.collm_version,
|
|
"alltoall_algorithm_chain_fanout",
|
|
"Fanout for chains used for alltoall algorithms. Only has meaning if algorithm is forced and supports chain topo based operation.",
|
|
false, false,
|
|
ompi_coll_tuned_init_chain_fanout, /* get system wide default */
|
|
NULL);
|
|
|
|
mca_param_indices->max_requests_param_index
|
|
= mca_base_param_reg_int(&mca_coll_tuned_component.super.collm_version,
|
|
"alltoall_algorithm_max_requests",
|
|
"Maximum number of outstanding send or recv requests. Only has meaning for synchronized algorithms.",
|
|
false, false,
|
|
ompi_coll_tuned_init_max_requests, /* get system wide default */
|
|
NULL);
|
|
mca_base_param_lookup_int(mca_param_indices->max_requests_param_index, &(max_requests));
|
|
if( max_requests <= 1 ) {
|
|
if( 0 == ompi_comm_rank( MPI_COMM_WORLD ) ) {
|
|
orte_output( 0, "Maximum outstanding requests must be positive number greater than 1. Switching to system level default %d \n",
|
|
ompi_coll_tuned_init_max_requests );
|
|
}
|
|
mca_base_param_set_int( mca_param_indices->max_requests_param_index,
|
|
ompi_coll_tuned_init_max_requests);
|
|
}
|
|
|
|
return (MPI_SUCCESS);
|
|
}
|
|
|
|
|
|
|
|
int ompi_coll_tuned_alltoall_intra_do_forced(void *sbuf, int scount,
|
|
struct ompi_datatype_t *sdtype,
|
|
void* rbuf, int rcount,
|
|
struct ompi_datatype_t *rdtype,
|
|
struct ompi_communicator_t *comm,
|
|
struct mca_coll_base_module_1_1_0_t *module)
|
|
{
|
|
mca_coll_tuned_module_t *tuned_module = (mca_coll_tuned_module_t*) module;
|
|
mca_coll_tuned_comm_t *data = tuned_module->tuned_data;
|
|
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,"coll:tuned:alltoall_intra_do_forced selected algorithm %d",
|
|
data->user_forced[ALLTOALL].algorithm));
|
|
|
|
switch (data->user_forced[ALLTOALL].algorithm) {
|
|
case (0): return ompi_coll_tuned_alltoall_intra_dec_fixed (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (1): return ompi_coll_tuned_alltoall_intra_basic_linear (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (2): return ompi_coll_tuned_alltoall_intra_pairwise (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (3): return ompi_coll_tuned_alltoall_intra_bruck (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (4): return ompi_coll_tuned_alltoall_intra_linear_sync (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module, data->user_forced[ALLTOALL].max_requests);
|
|
case (5): return ompi_coll_tuned_alltoall_intra_two_procs (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
default:
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,"coll:tuned:alltoall_intra_do_forced attempt to select algorithm %d when only 0-%d is valid?",
|
|
data->user_forced[ALLTOALL].algorithm, ompi_coll_tuned_forced_max_algorithms[ALLTOALL]));
|
|
return (MPI_ERR_ARG);
|
|
} /* switch */
|
|
|
|
}
|
|
|
|
|
|
int ompi_coll_tuned_alltoall_intra_do_this(void *sbuf, int scount,
|
|
struct ompi_datatype_t *sdtype,
|
|
void* rbuf, int rcount,
|
|
struct ompi_datatype_t *rdtype,
|
|
struct ompi_communicator_t *comm,
|
|
struct mca_coll_base_module_1_1_0_t *module,
|
|
int algorithm, int faninout, int segsize,
|
|
int max_requests)
|
|
{
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,"coll:tuned:alltoall_intra_do_this selected algorithm %d topo faninout %d segsize %d",
|
|
algorithm, faninout, segsize));
|
|
|
|
switch (algorithm) {
|
|
case (0): return ompi_coll_tuned_alltoall_intra_dec_fixed (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (1): return ompi_coll_tuned_alltoall_intra_basic_linear (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (2): return ompi_coll_tuned_alltoall_intra_pairwise (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (3): return ompi_coll_tuned_alltoall_intra_bruck (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
case (4): return ompi_coll_tuned_alltoall_intra_linear_sync (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module, max_requests);
|
|
case (5): return ompi_coll_tuned_alltoall_intra_two_procs (sbuf, scount, sdtype, rbuf, rcount, rdtype, comm, module);
|
|
default:
|
|
ORTE_OUTPUT((ompi_coll_tuned_stream,"coll:tuned:alltoall_intra_do_this attempt to select algorithm %d when only 0-%d is valid?",
|
|
algorithm, ompi_coll_tuned_forced_max_algorithms[ALLTOALL]));
|
|
return (MPI_ERR_ARG);
|
|
} /* switch */
|
|
|
|
}
|
|
|