adding missing files.
This commit was SVN r17462.
Этот коммит содержится в:
Rich Graham
родитель
41f4b06b39
Коммит
41943dbd76
45
ompi/mca/coll/sm2/coll_sm2_allreduce.c
Обычный файл
45
ompi/mca/coll/sm2/coll_sm2_allreduce.c
Обычный файл
@ -0,0 +1,45 @@
|
||||
/*
|
||||
* Copyright (c) 2007-2008 UT-Battelle, LLC
|
||||
* $COPYRIGHT$
|
||||
*
|
||||
* Additional copyrights may follow
|
||||
*
|
||||
* $HEADER$
|
||||
*/
|
||||
/** @file */
|
||||
|
||||
#include "ompi_config.h"
|
||||
|
||||
#include "ompi/constants.h"
|
||||
#include "coll_sm2.h"
|
||||
#include "ompi/op/op.h"
|
||||
|
||||
|
||||
/**
|
||||
* Shared memory blocking allreduce.
|
||||
*/
|
||||
int mca_coll_sm2_allreduce_intra(void *sbuf, void *rbuf, int count,
|
||||
struct ompi_datatype_t *dtype,
|
||||
struct ompi_op_t *op,
|
||||
struct ompi_communicator_t *comm,
|
||||
struct mca_coll_base_module_1_1_0_t *module)
|
||||
{
|
||||
/* local variables */
|
||||
int ret;
|
||||
char *sm_buffer;
|
||||
mca_coll_sm2_module_t *sm_module;
|
||||
|
||||
sm_module=(mca_coll_sm2_module_t *) module;
|
||||
|
||||
/* get a pointer to the shared-memory working buffer */
|
||||
|
||||
if( 0 != (op->o_flags & OMPI_OP_FLAGS_COMMUTE)) {
|
||||
/* Commutative Operation */
|
||||
} else {
|
||||
/* Non-Commutative Operation */
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
}
|
||||
281
ompi/mca/coll/sm2/coll_sm2_barrier.c
Обычный файл
281
ompi/mca/coll/sm2/coll_sm2_barrier.c
Обычный файл
@ -0,0 +1,281 @@
|
||||
/*
|
||||
* 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$
|
||||
*/
|
||||
/** @file */
|
||||
|
||||
#include "ompi_config.h"
|
||||
|
||||
#include "ompi/constants.h"
|
||||
#include "ompi/communicator/communicator.h"
|
||||
#include "ompi/mca/coll/coll.h"
|
||||
#include "opal/sys/atomic.h"
|
||||
#include "coll_sm2.h"
|
||||
|
||||
/**
|
||||
* Shared memory barrier.
|
||||
*
|
||||
* Tree-based algorithm for a barrier: a fan in to rank 0 followed by
|
||||
* a fan out using the barrier segments in the shared memory area.
|
||||
*
|
||||
* There are 2 sets of barrier buffers -- since there can only be, at
|
||||
* most, 2 outstanding barriers at any time, there is no need for more
|
||||
* than this. The generalized in-use flags, control, and data
|
||||
* segments are not used.
|
||||
*
|
||||
* The general algorithm is for a given process to wait for its N
|
||||
* children to fan in by monitoring a uint32_t in its barrier "in"
|
||||
* buffer. When this value reaches N (i.e., each of the children have
|
||||
* atomically incremented the value), then the process atomically
|
||||
* increases the uint32_t in its parent's "in" buffer. Then the
|
||||
* process waits for the parent to set a "1" in the process' "out"
|
||||
* buffer. Once this happens, the process writes a "1" in each of its
|
||||
* children's "out" buffers, and returns.
|
||||
*
|
||||
* There's corner cases, of course, such as the root that has no
|
||||
* parent, and the leaves that have no children. But that's the
|
||||
* general idea.
|
||||
*/
|
||||
int mca_coll_sm2_barrier_intra(struct ompi_communicator_t *comm,
|
||||
struct mca_coll_base_module_1_1_0_t *module)
|
||||
{
|
||||
|
||||
return OMPI_SUCCESS;
|
||||
}
|
||||
|
||||
/* non-blocking barrier - init function */
|
||||
int mca_coll_sm2_nbbarrier_intra(struct ompi_communicator_t *comm,
|
||||
mca_coll_sm2_nb_request_process_private_mem_t *request,
|
||||
struct mca_coll_base_module_1_1_0_t *module)
|
||||
{
|
||||
|
||||
/* local variables */
|
||||
int index;
|
||||
int child,cnt;
|
||||
long long tag;
|
||||
mca_coll_sm2_module_t *sm_module;
|
||||
mca_coll_sm2_nb_request_process_shared_mem_t *sm_barrier_region;
|
||||
mca_coll_sm2_nb_request_process_shared_mem_t *sm_address;
|
||||
|
||||
/* get pointer to nb-barrier structure */
|
||||
index=request->sm_index;
|
||||
sm_barrier_region=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
request->barrier_base_address[index];
|
||||
|
||||
/* set barrier tag - no atomicity needed as only only one outstanding
|
||||
* collective per communicator exists
|
||||
*/
|
||||
sm_module=(mca_coll_sm2_module_t *)module;
|
||||
sm_module->nb_barrier_tag++;
|
||||
request->tag=sm_module->nb_barrier_tag;
|
||||
tag=sm_module->nb_barrier_tag;
|
||||
|
||||
/*
|
||||
* Fan-in phase
|
||||
*/
|
||||
|
||||
/* check to see if children have checked in */
|
||||
cnt=0;
|
||||
for( child=0 ; child < sm_module->barrier_tree.n_children ; child++ ) {
|
||||
/* compute flag address */
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.children_ranks[child] *
|
||||
sm_module->segement_size_per_process);
|
||||
if(sm_address->flag == tag ) {
|
||||
/* child arrived */
|
||||
cnt++;
|
||||
} else {
|
||||
/* child not arrived, just break out */
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
/* if children have not checked in - set paramenters for async
|
||||
* completion, incomplet barrier flag, and bail
|
||||
*/
|
||||
if( cnt != sm_module->barrier_tree.n_children ) {
|
||||
/* set restart parameters, and exit */
|
||||
request->sm2_barrier_phase=NB_BARRIER_FAN_IN;
|
||||
return OMPI_SUCCESS;
|
||||
}
|
||||
|
||||
/* Set my completion flag */
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.children_ranks[sm_module->barrier_tree.my_rank] *
|
||||
sm_module->segement_size_per_process);
|
||||
sm_address->flag=tag;
|
||||
/* don't need memory barrier here, as we are not setting any other sm
|
||||
* data for someone else to read
|
||||
*/
|
||||
|
||||
/*
|
||||
* Fan-out phase
|
||||
*/
|
||||
|
||||
/*
|
||||
* check to see if parent has checked in
|
||||
*/
|
||||
if(sm_module->barrier_tree.n_parents > 0 ) {
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.parent_rank*
|
||||
sm_module->segement_size_per_process);
|
||||
if( sm_address->flag != -tag ) {
|
||||
/* set restart parameters, and exit */
|
||||
request->sm2_barrier_phase=NB_BARRIER_FAN_OUT;
|
||||
return OMPI_SUCCESS;
|
||||
}
|
||||
}
|
||||
|
||||
/* if parent has not checked in - set parameters for async
|
||||
* completion, incomplet barrier flag, and bail
|
||||
*/
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.children_ranks[sm_module->barrier_tree.my_rank] *
|
||||
sm_module->segement_size_per_process);
|
||||
sm_address->flag=-tag;
|
||||
|
||||
/*
|
||||
* set my completion flag
|
||||
*/
|
||||
request->sm2_barrier_phase=NB_BARRIER_DONE;
|
||||
|
||||
/*
|
||||
* set barrier completion flag
|
||||
*/
|
||||
|
||||
/* return - successful completion */
|
||||
return OMPI_SUCCESS;
|
||||
}
|
||||
|
||||
|
||||
/* non-blocking barrier - completion function */
|
||||
int mca_coll_sm2_nbbarrier_intra_progress(struct ompi_communicator_t *comm,
|
||||
mca_coll_sm2_nb_request_process_private_mem_t *request,
|
||||
struct mca_coll_base_module_1_1_0_t *module)
|
||||
{
|
||||
|
||||
/* local variables */
|
||||
int index;
|
||||
int child,cnt,phase;
|
||||
long long tag;
|
||||
mca_coll_sm2_module_t *sm_module;
|
||||
mca_coll_sm2_nb_request_process_shared_mem_t *sm_barrier_region;
|
||||
mca_coll_sm2_nb_request_process_shared_mem_t *sm_address;
|
||||
|
||||
/* get pointer to nb-barrier structure */
|
||||
index=request->sm_index;
|
||||
sm_barrier_region=request->barrier_base_address[index];
|
||||
|
||||
/* set barrier tag - no atomicity needed as only only one outstanding
|
||||
* collective per communicator exists
|
||||
*/
|
||||
sm_module=(mca_coll_sm2_module_t *)module;
|
||||
tag=request->tag;
|
||||
|
||||
phase=request->sm2_barrier_phase;
|
||||
if( NB_BARRIER_FAN_OUT == phase ) {
|
||||
goto FANOUT;
|
||||
} else if ( (NB_BARRIER_DONE == phase) || (NB_BARRIER_INACTIVE == phase) ) {
|
||||
goto DONE;
|
||||
}
|
||||
/* defult - NB_BARRIER_FAN_IN */
|
||||
|
||||
/*
|
||||
* Fan-in phase
|
||||
*/
|
||||
|
||||
/* check to see if children have checked in */
|
||||
cnt=0;
|
||||
for( child=0 ; child < sm_module->barrier_tree.n_children ; child++ ) {
|
||||
/* compute flag address */
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.children_ranks[child] *
|
||||
sm_module->segement_size_per_process);
|
||||
if(sm_address->flag == tag ) {
|
||||
/* child arrived */
|
||||
cnt++;
|
||||
} else {
|
||||
/* child not arrived, just break out */
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
/* if children have not checked in - set paramenters for async
|
||||
* completion, incomplet barrier flag, and bail
|
||||
*/
|
||||
if( cnt != sm_module->barrier_tree.n_children ) {
|
||||
/* set restart parameters, and exit */
|
||||
request->sm2_barrier_phase=NB_BARRIER_FAN_IN;
|
||||
return OMPI_SUCCESS;
|
||||
}
|
||||
|
||||
/* Set my completion flag */
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.children_ranks[sm_module->barrier_tree.my_rank] *
|
||||
sm_module->segement_size_per_process);
|
||||
sm_address->flag=tag;
|
||||
/* don't need memory barrier here, as we are not setting any other sm
|
||||
* data for someone else to read
|
||||
*/
|
||||
|
||||
FANOUT:
|
||||
/*
|
||||
* Fan-out phase
|
||||
*/
|
||||
|
||||
/*
|
||||
* check to see if parent has checked in
|
||||
*/
|
||||
if(sm_module->barrier_tree.n_parents > 0 ) {
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.parent_rank*
|
||||
sm_module->segement_size_per_process);
|
||||
if( sm_address->flag != -tag ) {
|
||||
/* set restart parameters, and exit */
|
||||
request->sm2_barrier_phase=NB_BARRIER_FAN_OUT;
|
||||
return OMPI_SUCCESS;
|
||||
}
|
||||
}
|
||||
|
||||
/* if parent has not checked in - set parameters for async
|
||||
* completion, incomplet barrier flag, and bail
|
||||
*/
|
||||
sm_address=(mca_coll_sm2_nb_request_process_shared_mem_t *)
|
||||
(sm_barrier_region+
|
||||
sm_module->barrier_tree.children_ranks[sm_module->barrier_tree.my_rank] *
|
||||
sm_module->segement_size_per_process);
|
||||
sm_address->flag=-tag;
|
||||
|
||||
/*
|
||||
* set my completion flag
|
||||
*/
|
||||
request->sm2_barrier_phase=NB_BARRIER_DONE;
|
||||
|
||||
/*
|
||||
* set barrier completion flag
|
||||
*/
|
||||
|
||||
DONE:
|
||||
/* return - successful completion */
|
||||
return OMPI_SUCCESS;
|
||||
}
|
||||
Загрузка…
x
Ссылка в новой задаче
Block a user