2006-09-15 01:29:51 +04:00
|
|
|
/*
|
|
|
|
|
* 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 "orte_config.h"
|
|
|
|
|
#include "orte/orte_constants.h"
|
|
|
|
|
|
|
|
|
|
#include "opal/mca/mca.h"
|
|
|
|
|
#include "opal/mca/base/base.h"
|
|
|
|
|
#include "opal/mca/base/mca_base_param.h"
|
|
|
|
|
#include "opal/util/output.h"
|
|
|
|
|
#include "opal/util/trace.h"
|
Squeeeeeeze the launch message. This is the message sent to the daemons that provides all the data required for launching their local procs. In reorganizing the ODLS framework, I discovered that we were sending a significant amount of unnecessary and repeated data. This commit resolves this by:
1. taking advantage of the fact that we no longer create the launch message via a GPR trigger. In earlier times, we had the GPR create the launch message based on a subscription. In that mode of operation, we could not guarantee the order in which the data was stored in the message - hence, we had no choice but to parse the message in a loop that checked each value against a list of possible "keys" until the corresponding value was found.
Now, however, we construct the message "by hand", so we know precisely what data is in each location in the message. Thus, we no longer need to send the character string "keys" for each data value any more. This represents a rather large savings in the message size - to give you an example, we typically would use a 30-char "key" for a 2-byte data value. As you can see, the overhead can become very large.
2. sending node-specific data only once. Again, because we used to construct the message via subscriptions that were done on a per-proc basis, the data for each node (e.g., the daemon's name, whether or not the node was oversubscribed) would be included in the data for each proc. Thus, the node-specific data was repeated for every proc.
Now that we construct the message "by hand", there is no reason to do this any more. Instead, we can insert the data for a specific node only once, and then provide the per-proc data for that node. We therefore not only save all that extra data in the message, but we also only need to parse the per-node data once.
The savings become significant at scale. Here is a comparison between the revised trunk and the trunk prior to this commit (all data was taken on odin, using openib, 64 nodes, unity message routing, tested with application consisting of mpi_init/mpi_barrier/mpi_finalize, all execution times given in seconds, all launch message sizes in bytes):
Per-node scaling, taken at 1ppn:
#nodes original trunk revised trunk
time size time size
1 0.10 819 0.09 564
2 0.14 1070 0.14 677
3 0.15 1321 0.14 790
4 0.15 1572 0.15 903
8 0.17 2576 0.20 1355
16 0.25 4584 0.21 2259
32 0.28 8600 0.27 4067
64 0.50 16632 0.39 7683
Per-proc scaling, taken at 64 nodes
ppn original trunk revised trunk
time size time size
1 0.50 16669 0.40 7720
2 0.55 32733 0.54 11048
3 0.87 48797 0.81 14376
4 1.0 64861 0.85 17704
Condensing those numbers, it appears we gained:
per-node message size: 251 bytes/node -> 113 bytes/node
per-proc message size: 251 bytes/proc -> 52 bytes/proc
per-job message size: 568 bytes/job -> 399 bytes/job
(job-specific data such as jobid, override oversubscribe flag, total #procs in job, total slots allocated)
The fact that the two pre-commit trunk numbers are the same confirms the fact that each proc was containing the node data as well. It isn't quite the 10x message reduction I had hoped to get, but it is significant and gives much better scaling.
Note that the timing info was, as usual, pretty chaotic - the numbers cited here were typical across several runs taken after the initial one to avoid NFS file positioning influences.
Also note that this commit removes the orte_process_info.vpid_start field and the handful of places that passed that useless value. By definition, all jobs start at vpid=0, so all we were doing is passing "0" around. In fact, many places simply hardwired it to "0" anyway rather than deal with it.
This commit was SVN r16428.
2007-10-11 19:57:26 +04:00
|
|
|
#include "opal/util/argv.h"
|
2006-09-15 01:29:51 +04:00
|
|
|
|
|
|
|
|
#include "orte/dss/dss.h"
|
|
|
|
|
#include "orte/util/proc_info.h"
|
|
|
|
|
#include "orte/mca/errmgr/errmgr.h"
|
2006-11-11 07:03:45 +03:00
|
|
|
#include "orte/mca/smr/smr_types.h"
|
2006-09-15 01:29:51 +04:00
|
|
|
|
|
|
|
|
#include "orte/mca/odls/base/base.h"
|
|
|
|
|
#include "orte/mca/odls/base/odls_private.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The following file was created by configure. It contains extern
|
|
|
|
|
* statements and the definition of an array of pointers to each
|
|
|
|
|
* component's public mca_base_component_t struct.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "orte/mca/odls/base/static-components.h"
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Instantiate globals
|
|
|
|
|
*/
|
|
|
|
|
orte_odls_base_module_t orte_odls;
|
|
|
|
|
|
2007-10-10 19:02:10 +04:00
|
|
|
/* instance the app_context list object */
|
Squeeeeeeze the launch message. This is the message sent to the daemons that provides all the data required for launching their local procs. In reorganizing the ODLS framework, I discovered that we were sending a significant amount of unnecessary and repeated data. This commit resolves this by:
1. taking advantage of the fact that we no longer create the launch message via a GPR trigger. In earlier times, we had the GPR create the launch message based on a subscription. In that mode of operation, we could not guarantee the order in which the data was stored in the message - hence, we had no choice but to parse the message in a loop that checked each value against a list of possible "keys" until the corresponding value was found.
Now, however, we construct the message "by hand", so we know precisely what data is in each location in the message. Thus, we no longer need to send the character string "keys" for each data value any more. This represents a rather large savings in the message size - to give you an example, we typically would use a 30-char "key" for a 2-byte data value. As you can see, the overhead can become very large.
2. sending node-specific data only once. Again, because we used to construct the message via subscriptions that were done on a per-proc basis, the data for each node (e.g., the daemon's name, whether or not the node was oversubscribed) would be included in the data for each proc. Thus, the node-specific data was repeated for every proc.
Now that we construct the message "by hand", there is no reason to do this any more. Instead, we can insert the data for a specific node only once, and then provide the per-proc data for that node. We therefore not only save all that extra data in the message, but we also only need to parse the per-node data once.
The savings become significant at scale. Here is a comparison between the revised trunk and the trunk prior to this commit (all data was taken on odin, using openib, 64 nodes, unity message routing, tested with application consisting of mpi_init/mpi_barrier/mpi_finalize, all execution times given in seconds, all launch message sizes in bytes):
Per-node scaling, taken at 1ppn:
#nodes original trunk revised trunk
time size time size
1 0.10 819 0.09 564
2 0.14 1070 0.14 677
3 0.15 1321 0.14 790
4 0.15 1572 0.15 903
8 0.17 2576 0.20 1355
16 0.25 4584 0.21 2259
32 0.28 8600 0.27 4067
64 0.50 16632 0.39 7683
Per-proc scaling, taken at 64 nodes
ppn original trunk revised trunk
time size time size
1 0.50 16669 0.40 7720
2 0.55 32733 0.54 11048
3 0.87 48797 0.81 14376
4 1.0 64861 0.85 17704
Condensing those numbers, it appears we gained:
per-node message size: 251 bytes/node -> 113 bytes/node
per-proc message size: 251 bytes/proc -> 52 bytes/proc
per-job message size: 568 bytes/job -> 399 bytes/job
(job-specific data such as jobid, override oversubscribe flag, total #procs in job, total slots allocated)
The fact that the two pre-commit trunk numbers are the same confirms the fact that each proc was containing the node data as well. It isn't quite the 10x message reduction I had hoped to get, but it is significant and gives much better scaling.
Note that the timing info was, as usual, pretty chaotic - the numbers cited here were typical across several runs taken after the initial one to avoid NFS file positioning influences.
Also note that this commit removes the orte_process_info.vpid_start field and the handful of places that passed that useless value. By definition, all jobs start at vpid=0, so all we were doing is passing "0" around. In fact, many places simply hardwired it to "0" anyway rather than deal with it.
This commit was SVN r16428.
2007-10-11 19:57:26 +04:00
|
|
|
static void orte_odls_app_context_constructor(orte_odls_app_context_t *ptr)
|
|
|
|
|
{
|
|
|
|
|
ptr->environ_copy = NULL;
|
|
|
|
|
}
|
|
|
|
|
static void orte_odls_app_context_destructor(orte_odls_app_context_t *ptr)
|
|
|
|
|
{
|
|
|
|
|
if (NULL != ptr->environ_copy) {
|
|
|
|
|
opal_argv_free(ptr->environ_copy);
|
|
|
|
|
}
|
|
|
|
|
}
|
2007-10-10 19:02:10 +04:00
|
|
|
OBJ_CLASS_INSTANCE(orte_odls_app_context_t,
|
|
|
|
|
opal_list_item_t,
|
Squeeeeeeze the launch message. This is the message sent to the daemons that provides all the data required for launching their local procs. In reorganizing the ODLS framework, I discovered that we were sending a significant amount of unnecessary and repeated data. This commit resolves this by:
1. taking advantage of the fact that we no longer create the launch message via a GPR trigger. In earlier times, we had the GPR create the launch message based on a subscription. In that mode of operation, we could not guarantee the order in which the data was stored in the message - hence, we had no choice but to parse the message in a loop that checked each value against a list of possible "keys" until the corresponding value was found.
Now, however, we construct the message "by hand", so we know precisely what data is in each location in the message. Thus, we no longer need to send the character string "keys" for each data value any more. This represents a rather large savings in the message size - to give you an example, we typically would use a 30-char "key" for a 2-byte data value. As you can see, the overhead can become very large.
2. sending node-specific data only once. Again, because we used to construct the message via subscriptions that were done on a per-proc basis, the data for each node (e.g., the daemon's name, whether or not the node was oversubscribed) would be included in the data for each proc. Thus, the node-specific data was repeated for every proc.
Now that we construct the message "by hand", there is no reason to do this any more. Instead, we can insert the data for a specific node only once, and then provide the per-proc data for that node. We therefore not only save all that extra data in the message, but we also only need to parse the per-node data once.
The savings become significant at scale. Here is a comparison between the revised trunk and the trunk prior to this commit (all data was taken on odin, using openib, 64 nodes, unity message routing, tested with application consisting of mpi_init/mpi_barrier/mpi_finalize, all execution times given in seconds, all launch message sizes in bytes):
Per-node scaling, taken at 1ppn:
#nodes original trunk revised trunk
time size time size
1 0.10 819 0.09 564
2 0.14 1070 0.14 677
3 0.15 1321 0.14 790
4 0.15 1572 0.15 903
8 0.17 2576 0.20 1355
16 0.25 4584 0.21 2259
32 0.28 8600 0.27 4067
64 0.50 16632 0.39 7683
Per-proc scaling, taken at 64 nodes
ppn original trunk revised trunk
time size time size
1 0.50 16669 0.40 7720
2 0.55 32733 0.54 11048
3 0.87 48797 0.81 14376
4 1.0 64861 0.85 17704
Condensing those numbers, it appears we gained:
per-node message size: 251 bytes/node -> 113 bytes/node
per-proc message size: 251 bytes/proc -> 52 bytes/proc
per-job message size: 568 bytes/job -> 399 bytes/job
(job-specific data such as jobid, override oversubscribe flag, total #procs in job, total slots allocated)
The fact that the two pre-commit trunk numbers are the same confirms the fact that each proc was containing the node data as well. It isn't quite the 10x message reduction I had hoped to get, but it is significant and gives much better scaling.
Note that the timing info was, as usual, pretty chaotic - the numbers cited here were typical across several runs taken after the initial one to avoid NFS file positioning influences.
Also note that this commit removes the orte_process_info.vpid_start field and the handful of places that passed that useless value. By definition, all jobs start at vpid=0, so all we were doing is passing "0" around. In fact, many places simply hardwired it to "0" anyway rather than deal with it.
This commit was SVN r16428.
2007-10-11 19:57:26 +04:00
|
|
|
orte_odls_app_context_constructor,
|
|
|
|
|
orte_odls_app_context_destructor);
|
2007-10-10 19:02:10 +04:00
|
|
|
|
|
|
|
|
|
2006-11-11 07:03:45 +03:00
|
|
|
/* instance the child list object */
|
|
|
|
|
static void orte_odls_child_constructor(orte_odls_child_t *ptr)
|
|
|
|
|
{
|
|
|
|
|
ptr->name = NULL;
|
Compute and pass the local_rank and local number of procs (in that proc's job) on the node.
To be precise, given this hypothetical launching pattern:
host1: vpids 0, 2, 4, 6
host2: vpids 1, 3, 5, 7
The local_rank for these procs would be:
host1: vpids 0->local_rank 0, v2->lr1, v4->lr2, v6->lr3
host2: vpids 1->local_rank 0, v3->lr1, v5->lr2, v7->lr3
and the number of local procs on each node would be four. If vpid=0 then does a comm_spawn of one process on host1, the values of the parent job would remain unchanged. The local_rank of the child process would be 0 and its num_local_procs would be 1 since it is in a separate jobid.
I have verified this functionality for the rsh case - need to verify that slurm and other cases also get the right values. Some consolidation of common code is probably going to occur in the SDS components to make this simpler and more maintainable in the future.
This commit was SVN r14706.
2007-05-21 18:30:10 +04:00
|
|
|
ptr->local_rank = ORTE_VPID_INVALID;
|
2006-11-11 07:03:45 +03:00
|
|
|
ptr->pid = 0;
|
|
|
|
|
ptr->app_idx = -1;
|
|
|
|
|
ptr->alive = false;
|
|
|
|
|
ptr->state = ORTE_PROC_STATE_UNDEF;
|
2007-04-24 22:54:45 +04:00
|
|
|
ptr->exit_code = 0;
|
2007-07-14 19:14:07 +04:00
|
|
|
ptr->cpu_set = 0xffffffff;
|
These changes were mostly captured in a prior RFC (except for #2 below) and are aimed specifically at improving startup performance and setting up the remaining modifications described in that RFC.
The commit has been tested for C/R and Cray operations, and on Odin (SLURM, rsh) and RoadRunner (TM). I tried to update all environments, but obviously could not test them. I know that Windows needs some work, and have highlighted what is know to be needed in the odls process component.
This represents a lot of work by Brian, Tim P, Josh, and myself, with much advice from Jeff and others. For posterity, I have appended a copy of the email describing the work that was done:
As we have repeatedly noted, the modex operation in MPI_Init is the single greatest consumer of time during startup. To-date, we have executed that operation as an ORTE stage gate that held the process until a startup message containing all required modex (and OOB contact info - see #3 below) info could be sent to it. Each process would send its data to the HNP's registry, which assembled and sent the message when all processes had reported in.
In addition, ORTE had taken responsibility for monitoring process status as it progressed through a series of "stage gates". The process reported its status at each gate, and ORTE would then send a "release" message once all procs had reported in.
The incoming changes revamp these procedures in three ways:
1. eliminating the ORTE stage gate system and cleanly delineating responsibility between the OMPI and ORTE layers for MPI init/finalize. The modex stage gate (STG1) has been replaced by a collective operation in the modex itself that performs an allgather on the required modex info. The allgather is implemented using the orte_grpcomm framework since the BTL's are not active at that point. At the moment, the grpcomm framework only has a "basic" component analogous to OMPI's "basic" coll framework - I would recommend that the MPI team create additional, more advanced components to improve performance of this step.
The other stage gates have been replaced by orte_grpcomm barrier functions. We tried to use MPI barriers instead (since the BTL's are active at that point), but - as we discussed on the telecon - these are not currently true barriers so the job would hang when we fell through while messages were still in process. Note that the grpcomm barrier doesn't actually resolve that problem, but Brian has pointed out that we are unlikely to ever see it violated. Again, you might want to spend a little time on an advanced barrier algorithm as the one in "basic" is very simplistic.
Summarizing this change: ORTE no longer tracks process state nor has direct responsibility for synchronizing jobs. This is now done via collective operations within the MPI layer, albeit using ORTE collective communication services. I -strongly- urge the MPI team to implement advanced collective algorithms to improve the performance of this critical procedure.
2. reducing the volume of data exchanged during modex. Data in the modex consisted of the process name, the name of the node where that process is located (expressed as a string), plus a string representation of all contact info. The nodename was required in order for the modex to determine if the process was local or not - in addition, some people like to have it to print pretty error messages when a connection failed.
The size of this data has been reduced in three ways:
(a) reducing the size of the process name itself. The process name consisted of two 32-bit fields for the jobid and vpid. This is far larger than any current system, or system likely to exist in the near future, can support. Accordingly, the default size of these fields has been reduced to 16-bits, which means you can have 32k procs in each of 32k jobs. Since the daemons must have a vpid, and we require one daemon/node, this also restricts the default configuration to 32k nodes.
To support any future "mega-clusters", a configuration option --enable-jumbo-apps has been added. This option increases the jobid and vpid field sizes to 32-bits. Someday, if necessary, someone can add yet another option to increase them to 64-bits, I suppose.
(b) replacing the string nodename with an integer nodeid. Since we have one daemon/node, the nodeid corresponds to the local daemon's vpid. This replaces an often lengthy string with only 2 (or at most 4) bytes, a substantial reduction.
(c) when the mca param requesting that nodenames be sent to support pretty error messages, a second mca param is now used to request FQDN - otherwise, the domain name is stripped (by default) from the message to save space. If someone wants to combine those into a single param somehow (perhaps with an argument?), they are welcome to do so - I didn't want to alter what people are already using.
While these may seem like small savings, they actually amount to a significant impact when aggregated across the entire modex operation. Since every proc must receive the modex data regardless of the collective used to send it, just reducing the size of the process name removes nearly 400MBytes of communication from a 32k proc job (admittedly, much of this comm may occur in parallel). So it does add up pretty quickly.
3. routing RML messages to reduce connections. The default messaging system remains point-to-point - i.e., each proc opens a socket to every proc it communicates with and sends its messages directly. A new option uses the orteds as routers - i.e., each proc only opens a single socket to its local orted. All messages are sent from the proc to the orted, which forwards the message to the orted on the node where the intended recipient proc is located - that orted then forwards the message to its local proc (the recipient). This greatly reduces the connection storm we have encountered during startup.
It also has the benefit of removing the sharing of every proc's OOB contact with every other proc. The orted routing tables are populated during launch since every orted gets a map of where every proc is being placed. Each proc, therefore, only needs to know the contact info for its local daemon, which is passed in via the environment when the proc is fork/exec'd by the daemon. This alone removes ~50 bytes/process of communication that was in the current STG1 startup message - so for our 32k proc job, this saves us roughly 32k*50 = 1.6MBytes sent to 32k procs = 51GBytes of messaging.
Note that you can use the new routing method by specifying -mca routed tree - if you so desire. This mode will become the default at some point in the future.
There are a few minor additional changes in the commit that I'll just note in passing:
* propagation of command line mca params to the orteds - fixes ticket #1073. See note there for details.
* requiring of "finalize" prior to "exit" for MPI procs - fixes ticket #1144. See note there for details.
* cleanup of some stale header files
This commit was SVN r16364.
2007-10-05 23:48:23 +04:00
|
|
|
ptr->sync_required = false;
|
2007-07-14 19:14:07 +04:00
|
|
|
|
2006-11-11 07:03:45 +03:00
|
|
|
}
|
|
|
|
|
static void orte_odls_child_destructor(orte_odls_child_t *ptr)
|
|
|
|
|
{
|
|
|
|
|
if (NULL != ptr->name) free(ptr->name);
|
|
|
|
|
}
|
|
|
|
|
OBJ_CLASS_INSTANCE(orte_odls_child_t,
|
|
|
|
|
opal_list_item_t,
|
|
|
|
|
orte_odls_child_constructor,
|
|
|
|
|
orte_odls_child_destructor);
|
|
|
|
|
|
2006-09-15 01:29:51 +04:00
|
|
|
/*
|
|
|
|
|
* Framework global variables
|
|
|
|
|
*/
|
|
|
|
|
orte_odls_base_t orte_odls_base;
|
|
|
|
|
orte_odls_globals_t orte_odls_globals;
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Function for finding and opening either all MCA components, or the one
|
|
|
|
|
* that was specifically requested via a MCA parameter.
|
|
|
|
|
*/
|
|
|
|
|
int orte_odls_base_open(void)
|
|
|
|
|
{
|
|
|
|
|
int param, value, rc;
|
|
|
|
|
orte_data_type_t tmp;
|
|
|
|
|
|
|
|
|
|
OPAL_TRACE(5);
|
|
|
|
|
|
|
|
|
|
/* Debugging / verbose output */
|
|
|
|
|
|
2007-08-18 07:05:45 +04:00
|
|
|
param = mca_base_param_reg_int_name("odls", "base_verbose",
|
2006-09-15 01:29:51 +04:00
|
|
|
"Verbosity level for the odls framework",
|
|
|
|
|
false, false, 0, &value);
|
|
|
|
|
if (value != 0) {
|
|
|
|
|
orte_odls_globals.output = opal_output_open(NULL);
|
|
|
|
|
} else {
|
|
|
|
|
orte_odls_globals.output = -1;
|
|
|
|
|
}
|
|
|
|
|
|
2007-08-18 07:05:45 +04:00
|
|
|
mca_base_param_reg_int_name("odls", "base_sigkill_timeout",
|
2006-11-17 05:58:46 +03:00
|
|
|
"Time to wait for a process to die after issuing a kill signal to it",
|
|
|
|
|
false, false, 1, &orte_odls_globals.timeout_before_sigkill);
|
Bring in the code for routing xcast stage gate messages via the local orteds. This code is inactive unless you specifically request it via an mca param oob_xcast_mode (can be set to "linear" or "direct"). Direct mode is the old standard method where we send messages directly to each MPI process. Linear mode sends the xcast message via the orteds, with the HNP sending the message to each orted directly.
There is a binomial algorithm in the code (i.e., the HNP would send to a subset of the orteds, which then relay it on according to the typical log-2 algo), but that has a bug in it so the code won't let you select it even if you tried (and the mca param doesn't show, so you'd *really* have to try).
This also involved a slight change to the oob.xcast API, so propagated that as required.
Note: this has *only* been tested on rsh, SLURM, and Bproc environments (now that it has been transferred to the OMPI trunk, I'll need to re-test it [only done rsh so far]). It should work fine on any environment that uses the ORTE daemons - anywhere else, you are on your own... :-)
Also, correct a mistake where the orte_debug_flag was declared an int, but the mca param was set as a bool. Move the storage for that flag to the orte/runtime/params.c and orte/runtime/params.h files appropriately.
This commit was SVN r14475.
2007-04-23 22:41:04 +04:00
|
|
|
|
2006-09-15 01:29:51 +04:00
|
|
|
/* register the daemon cmd data type */
|
|
|
|
|
tmp = ORTE_DAEMON_CMD;
|
|
|
|
|
if (ORTE_SUCCESS != (rc = orte_dss.register_type(orte_odls_pack_daemon_cmd,
|
|
|
|
|
orte_odls_unpack_daemon_cmd,
|
|
|
|
|
(orte_dss_copy_fn_t)orte_odls_copy_daemon_cmd,
|
|
|
|
|
(orte_dss_compare_fn_t)orte_odls_compare_daemon_cmd,
|
|
|
|
|
(orte_dss_size_fn_t)orte_odls_size_daemon_cmd,
|
|
|
|
|
(orte_dss_print_fn_t)orte_odls_print_daemon_cmd,
|
|
|
|
|
(orte_dss_release_fn_t)orte_odls_std_release,
|
|
|
|
|
ORTE_DSS_UNSTRUCTURED,
|
|
|
|
|
"ORTE_DAEMON_CMD", &tmp))) {
|
|
|
|
|
ORTE_ERROR_LOG(rc);
|
|
|
|
|
return rc;
|
|
|
|
|
}
|
|
|
|
|
|
2007-10-10 19:02:10 +04:00
|
|
|
/* initialize globals */
|
|
|
|
|
OBJ_CONSTRUCT(&orte_odls_globals.mutex, opal_mutex_t);
|
|
|
|
|
OBJ_CONSTRUCT(&orte_odls_globals.cond, opal_condition_t);
|
|
|
|
|
OBJ_CONSTRUCT(&orte_odls_globals.children, opal_list_t);
|
|
|
|
|
|
2006-09-15 01:29:51 +04:00
|
|
|
/* Open up all available components */
|
|
|
|
|
|
|
|
|
|
if (ORTE_SUCCESS !=
|
|
|
|
|
mca_base_components_open("odls", orte_odls_globals.output,
|
|
|
|
|
mca_odls_base_static_components,
|
|
|
|
|
&orte_odls_base.available_components, true)) {
|
|
|
|
|
return ORTE_ERROR;
|
|
|
|
|
}
|
2007-01-27 18:37:13 +03:00
|
|
|
|
|
|
|
|
/* are there components available for use ? -
|
|
|
|
|
* orte_odls_base.available_components is always initialized */
|
|
|
|
|
if(0 < opal_list_get_size(&(orte_odls_base.available_components))) {
|
|
|
|
|
orte_odls_base.components_available = true;
|
|
|
|
|
} else {
|
|
|
|
|
orte_odls_base.components_available = false;
|
|
|
|
|
}
|
2006-09-15 01:29:51 +04:00
|
|
|
|
|
|
|
|
/* All done */
|
|
|
|
|
|
|
|
|
|
return ORTE_SUCCESS;
|
|
|
|
|
}
|