1
1

Started to add basic linear functions

Also started to add the allreduce algorithms as I test them
(i.e. if it goes in its after testing from now on)

This commit was SVN r7886.
Этот коммит содержится в:
Graham Fagg 2005-10-26 23:11:32 +00:00
родитель d47ce065e9
Коммит c3e1dc410d
7 изменённых файлов: 380 добавлений и 1 удалений

Просмотреть файл

@ -20,6 +20,9 @@ sources = \
coll_tuned_topo.c \
coll_tuned_util.h \
coll_tuned_util.c \
coll_tuned_allreduce_decision_fixed.c \
coll_tuned_allreduce_decision_dynamic.c \
coll_tuned_allreduce.c \
coll_tuned_alltoall_decision_fixed.c \
coll_tuned_alltoall_decision_dynamic.c \
coll_tuned_alltoall.c \

Просмотреть файл

@ -46,6 +46,11 @@ OMPI_COMP_EXPORT extern int mca_coll_tuned_init_tree_fanout;
OMPI_COMP_EXPORT extern int mca_coll_tuned_init_chain_fanout;
/* forced algorithm choices */
OMPI_COMP_EXPORT extern int mca_coll_tuned_allreduce_forced_choice;
OMPI_COMP_EXPORT extern int mca_coll_tuned_allreduce_forced_segsize;
OMPI_COMP_EXPORT extern int mca_coll_tuned_allreduce_forced_tree_fanout;
OMPI_COMP_EXPORT extern int mca_coll_tuned_allreduce_forced_chain_fanout;
OMPI_COMP_EXPORT extern int mca_coll_tuned_alltoall_forced_choice;
OMPI_COMP_EXPORT extern int mca_coll_tuned_alltoall_forced_segsize;
OMPI_COMP_EXPORT extern int mca_coll_tuned_alltoall_forced_tree_fanout;
@ -141,6 +146,27 @@ OMPI_COMP_EXPORT extern int mca_coll_tuned_reduce_forced_chain_fanout;
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm);
int mca_coll_tuned_allreduce_intra_do_forced(void *sbuf, void *rbuf,
int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm);
int mca_coll_tuned_allreduce_intra_check_forced(void);
int mca_coll_tuned_allreduce_intra_query(void);
int mca_coll_tuned_allreduce_intra_nonoverlapping(void *sbuf, void *rbuf,
int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm);
int mca_coll_tuned_allreduce_intra_basic_linear(void *sbuf, void *rbuf,
int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm);
int mca_coll_tuned_allreduce_inter_dec_fixed(void *sbuf, void *rbuf,
int count,
struct ompi_datatype_t *dtype,

224
ompi/mca/coll/tuned/coll_tuned_allreduce.c Обычный файл
Просмотреть файл

@ -0,0 +1,224 @@
/*
* Copyright (c) 2004-2005 The Trustees of Indiana University.
* All rights reserved.
* Copyright (c) 2004-2005 The Trustees of the University of Tennessee.
* 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/include/constants.h"
#include "datatype/datatype.h"
#include "communicator/communicator.h"
#include "mca/coll/coll.h"
#include "mca/coll/base/coll_tags.h"
#include "mca/pml/pml.h"
#include "op/op.h"
#include "coll_tuned.h"
#include "coll_tuned_topo.h"
#include <sys/types.h>
#include <unistd.h>
/* temp debug routines */
static int dump_buf_int (char* ptr, int count, char *comment, int rank);
static int dump_buf_int (char* ptr, int count, char *comment, int rank) {
int i=0;
int *tptr;
int c=0;
tptr=(int*)ptr;
printf("%1d ", rank);
if (comment) printf("%s ", comment);
if (count <0) {
printf("cnt %d?\n", count);
return (0);
}
if (count>5) c = 5;
else c = count;
printf("Cnt %1d ", count);
for(i=0;i<c;i++) {
printf("%1d [%1d] ", i, *tptr++);
}
if (c!=count) {
tptr=(int*)ptr;
printf(" ... %1d [%1d]", count-1, tptr[count-1]);
}
printf("\n");
return (0);
}
/*
* mca_coll_tuned_allreduce_intra_nonoverlapping
*
* This function just calls a reduce followed by a broadcast
* both called functions are tuned but they complete sequentially,
* i.e. no additional overlapping
* meaning if the number of segments used is greater than the topo depth
* then once the first segment of data is fully 'reduced' it is not broadcast
* while the reduce continues (cost = cost-reduce + cost-bcast + decision x 3)
*
*/
int
mca_coll_tuned_allreduce_intra_nonoverlapping(void *sbuf, void *rbuf, int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm)
{
int err;
int rank;
rank = ompi_comm_rank(comm);
OPAL_OUTPUT((mca_coll_tuned_stream,"coll:tuned:allreduce_intra_nonoverlapping rank %d", rank));
/* Reduce to 0 and broadcast. */
if (MPI_IN_PLACE == sbuf) {
if (0 == ompi_comm_rank(comm)) {
err = comm->c_coll.coll_reduce (MPI_IN_PLACE, rbuf, count, dtype, op, 0, comm);
} else {
err = comm->c_coll.coll_reduce (rbuf, NULL, count, dtype, op, 0, comm);
}
} else {
err = comm->c_coll.coll_reduce (sbuf, rbuf, count, dtype, op, 0, comm);
}
if (MPI_SUCCESS != err) {
return err;
}
return comm->c_coll.coll_bcast (rbuf, count, dtype, 0, comm);
}
/*
* 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 */
/*
* allreduce_intra
*
* Function: - allreduce using other MPI collectives
* Accepts: - same as MPI_Allreduce()
* Returns: - MPI_SUCCESS or error code
*/
int
mca_coll_tuned_allreduce_intra_basic_linear(void *sbuf, void *rbuf, int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm)
{
int err;
int rank;
rank = ompi_comm_rank(comm);
OPAL_OUTPUT((mca_coll_tuned_stream,"coll:tuned:allreduce_intra_basic_linear rank %d", rank));
/* Reduce to 0 and broadcast. */
if (MPI_IN_PLACE == sbuf) {
if (0 == ompi_comm_rank(comm)) {
err = mca_coll_tuned_reduce_intra_basic_linear (MPI_IN_PLACE, rbuf, count, dtype, op, 0, comm);
} else {
err = mca_coll_tuned_reduce_intra_basic_linear(rbuf, NULL, count, dtype, op, 0, comm);
}
} else {
err = mca_coll_tuned_reduce_intra_basic_linear(sbuf, rbuf, count, dtype, op, 0, comm);
}
if (MPI_SUCCESS != err) {
return err;
}
return mca_coll_tuned_bcast_intra_basic_linear(rbuf, count, dtype, 0, comm);
}
/* 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 */
int mca_coll_tuned_allreduce_intra_check_forced ( )
{
mca_base_param_reg_int(&mca_coll_tuned_component.collm_version,
"allreduce_algorithm",
"Which allreduce algorithm is used. Can be locked down to choice of: 0 ignore, 1 basic linear, 2 nonoverlapping (tuned reduce + tuned bcast)",
false, false, mca_coll_tuned_allreduce_forced_choice,
&mca_coll_tuned_allreduce_forced_choice);
mca_base_param_reg_int(&mca_coll_tuned_component.collm_version,
"allreduce_algorithm_segmentsize",
"Segment size in bytes used by default for allreduce algorithms. Only has meaning if algorithm is forced and supports segmenting. 0 bytes means no segmentation.",
false, false, mca_coll_tuned_allreduce_forced_segsize,
&mca_coll_tuned_allreduce_forced_segsize);
mca_base_param_reg_int(&mca_coll_tuned_component.collm_version,
"allreduce_algorithm_tree_fanout",
"Fanout for n-tree used for allreduce algorithms. Only has meaning if algorithm is forced and supports n-tree topo based operation.",
false, false,
mca_coll_tuned_init_tree_fanout, /* get system wide default */
&mca_coll_tuned_allreduce_forced_tree_fanout);
mca_base_param_reg_int(&mca_coll_tuned_component.collm_version,
"allreduce_algorithm_chain_fanout",
"Fanout for chains used for allreduce algorithms. Only has meaning if algorithm is forced and supports chain topo based operation.",
false, false,
mca_coll_tuned_init_chain_fanout, /* get system wide default */
&mca_coll_tuned_allreduce_forced_chain_fanout);
return (MPI_SUCCESS);
}
int mca_coll_tuned_allreduce_intra_query ( )
{
return (2); /* 2 algorithms available */
}
int mca_coll_tuned_allreduce_intra_do_forced(void *sbuf, void *rbuf, int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm)
{
switch (mca_coll_tuned_allreduce_forced_choice) {
case (0): return mca_coll_tuned_allreduce_intra_dec_fixed (sbuf, rbuf, count, dtype, op, comm);
case (1): return mca_coll_tuned_allreduce_intra_basic_linear (sbuf, rbuf, count, dtype, op, comm);
case (2): return mca_coll_tuned_allreduce_intra_nonoverlapping (sbuf, rbuf, count, dtype, op, comm);
default:
OPAL_OUTPUT((mca_coll_tuned_stream,"coll:tuned:allreduce_intra_do_forced attempt to select algorithm %d when only 0-%d is valid?",
mca_coll_tuned_allreduce_forced_choice, mca_coll_tuned_allreduce_intra_query()));
return (MPI_ERR_ARG);
} /* switch */
}

Просмотреть файл

@ -0,0 +1,59 @@
/*
* Copyright (c) 2004-2005 The Trustees of Indiana University.
* All rights reserved.
* Copyright (c) 2004-2005 The Trustees of the University of Tennessee.
* 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 "include/constants.h"
#include "datatype/datatype.h"
#include "communicator/communicator.h"
#include "mca/coll/coll.h"
#include "mca/coll/base/coll_tags.h"
#include "coll_tuned.h"
#include "mca/pml/pml.h"
#include "opal/util/bit_ops.h"
#include "coll_tuned.h"
/*
* allreduce_intra
*
* Function: - allreduce using other MPI collectives
* Accepts: - same as MPI_Allreduce()
* Returns: - MPI_SUCCESS or error code
*/
int
mca_coll_tuned_allreduce_intra_dec_dynamic (void *sbuf, void *rbuf, int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm)
{
int i;
int size;
int rank;
int err;
int contig;
int dsize;
OPAL_OUTPUT((mca_coll_tuned_stream, "mca_coll_tuned_allreduce_intra_dec_dynamic"));
size = ompi_comm_size(comm);
rank = ompi_comm_rank(comm);
return OMPI_ERR_NOT_IMPLEMENTED;
}

Просмотреть файл

@ -0,0 +1,61 @@
/*
* Copyright (c) 2004-2005 The Trustees of Indiana University.
* All rights reserved.
* Copyright (c) 2004-2005 The Trustees of the University of Tennessee.
* 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 "include/constants.h"
#include "datatype/datatype.h"
#include "communicator/communicator.h"
#include "mca/coll/coll.h"
#include "mca/coll/base/coll_tags.h"
#include "coll_tuned.h"
#include "mca/pml/pml.h"
#include "opal/util/bit_ops.h"
#include "coll_tuned.h"
/*
* allreduce_intra
*
* Function: - allreduce using other MPI collectives
* Accepts: - same as MPI_Allreduce()
* Returns: - MPI_SUCCESS or error code
*/
int
mca_coll_tuned_allreduce_intra_dec_fixed (void *sbuf, void *rbuf, int count,
struct ompi_datatype_t *dtype,
struct ompi_op_t *op,
struct ompi_communicator_t *comm)
{
int i;
int size;
int rank;
int err;
int contig;
int dsize;
OPAL_OUTPUT((mca_coll_tuned_stream, "mca_coll_tuned_allreduce_intra_dec_fixed"));
size = ompi_comm_size(comm);
rank = ompi_comm_rank(comm);
return (mca_coll_tuned_allreduce_intra_nonoverlapping (sbuf, rbuf, count, dtype, op, comm));
}

Просмотреть файл

@ -254,7 +254,7 @@ int mca_coll_tuned_barrier_intra_do_forced(struct ompi_communicator_t *comm)
{
switch (mca_coll_tuned_barrier_forced_choice) {
case (0): return mca_coll_tuned_barrier_intra_dec_fixed (comm);
/* case (1): return mca_coll_tuned_barrier_intra_linear (comm); */
/* case (1): return mca_coll_tuned_barrier_intra_basic_linear (comm); */
case (2): return mca_coll_tuned_barrier_intra_doublering (comm);
case (3): return mca_coll_tuned_barrier_intra_recursivedoubling (comm);
case (4): return mca_coll_tuned_barrier_intra_bruck (comm);

Просмотреть файл

@ -44,6 +44,11 @@ int mca_coll_tuned_init_tree_fanout = 4;
int mca_coll_tuned_init_chain_fanout = 4;
/* forced alogrithm variables */
int mca_coll_tuned_allreduce_forced_choice = 0;
int mca_coll_tuned_allreduce_forced_segsize = 0;
int mca_coll_tuned_allreduce_forced_chain_fanout = 0;
int mca_coll_tuned_allreduce_forced_tree_fanout = 0;
int mca_coll_tuned_alltoall_forced_choice = 0;
int mca_coll_tuned_alltoall_forced_segsize = 0;
int mca_coll_tuned_alltoall_forced_chain_fanout = 0;
@ -167,6 +172,7 @@ static int tuned_open(void)
/* this is useful for benchmarking and user knows best tuning */
/* intra functions first */
mca_coll_tuned_allreduce_intra_check_forced();
mca_coll_tuned_alltoall_intra_check_forced();
mca_coll_tuned_barrier_intra_check_forced();
mca_coll_tuned_bcast_intra_check_forced();