a200e4f865
*** THIS RFC INCLUDES A MINOR CHANGE TO THE MPI-RTE INTERFACE *** Note: during the course of this work, it was necessary to completely separate the MPI and RTE progress engines. There were multiple places in the MPI layer where ORTE_WAIT_FOR_COMPLETION was being used. A new OMPI_WAIT_FOR_COMPLETION macro was created (defined in ompi/mca/rte/rte.h) that simply cycles across opal_progress until the provided flag becomes false. Places where the MPI layer blocked waiting for RTE to complete an event have been modified to use this macro. *************************************************************************************** I am reissuing this RFC because of the time that has passed since its original release. Since its initial release and review, I have debugged it further to ensure it fully supports tests like loop_spawn. It therefore seems ready for merge back to the trunk. Given its prior review, I have set the timeout for one week. The code is in https://bitbucket.org/rhc/ompi-oob2 WHAT: Rewrite of ORTE OOB WHY: Support asynchronous progress and a host of other features WHEN: Wed, August 21 SYNOPSIS: The current OOB has served us well, but a number of limitations have been identified over the years. Specifically: * it is only progressed when called via opal_progress, which can lead to hangs or recursive calls into libevent (which is not supported by that code) * we've had issues when multiple NICs are available as the code doesn't "shift" messages between transports - thus, all nodes had to be available via the same TCP interface. * the OOB "unloads" incoming opal_buffer_t objects during the transmission, thus preventing use of OBJ_RETAIN in the code when repeatedly sending the same message to multiple recipients * there is no failover mechanism across NICs - if the selected NIC (or its attached switch) fails, we are forced to abort * only one transport (i.e., component) can be "active" The revised OOB resolves these problems: * async progress is used for all application processes, with the progress thread blocking in the event library * each available TCP NIC is supported by its own TCP module. The ability to asynchronously progress each module independently is provided, but not enabled by default (a runtime MCA parameter turns it "on") * multi-address TCP NICs (e.g., a NIC with both an IPv4 and IPv6 address, or with virtual interfaces) are supported - reachability is determined by comparing the contact info for a peer against all addresses within the range covered by the address/mask pairs for the NIC. * a message that arrives on one TCP NIC is automatically shifted to whatever NIC that is connected to the next "hop" if that peer cannot be reached by the incoming NIC. If no TCP module will reach the peer, then the OOB attempts to send the message via all other available components - if none can reach the peer, then an "error" is reported back to the RML, which then calls the errmgr for instructions. * opal_buffer_t now conforms to standard object rules re OBJ_RETAIN as we no longer "unload" the incoming object * NIC failure is reported to the TCP component, which then tries to resend the message across any other available TCP NIC. If that doesn't work, then the message is given back to the OOB base to try using other components. If all that fails, then the error is reported to the RML, which reports to the errmgr for instructions * obviously from the above, multiple OOB components (e.g., TCP and UD) can be active in parallel * the matching code has been moved to the RML (and out of the OOB/TCP component) so it is independent of transport * routing is done by the individual OOB modules (as opposed to the RML). Thus, both routed and non-routed transports can simultaneously be active * all blocking send/recv APIs have been removed. Everything operates asynchronously. KNOWN LIMITATIONS: * although provision is made for component failover as described above, the code for doing so has not been fully implemented yet. At the moment, if all connections for a given peer fail, the errmgr is notified of a "lost connection", which by default results in termination of the job if it was a lifeline * the IPv6 code is present and compiles, but is not complete. Since the current IPv6 support in the OOB doesn't work anyway, I don't consider this a blocker * routing is performed at the individual module level, yet the active routed component is selected on a global basis. We probably should update that to reflect that different transports may need/choose to route in different ways * obviously, not every error path has been tested nor necessarily covered * determining abnormal termination is more challenging than in the old code as we now potentially have multiple ways of connecting to a process. Ideally, we would declare "connection failed" when *all* transports can no longer reach the process, but that requires some additional (possibly complex) code. For now, the code replicates the old behavior only somewhat modified - i.e., if a module sees its connection fail, it checks to see if it is a lifeline. If so, it notifies the errmgr that the lifeline is lost - otherwise, it notifies the errmgr that a non-lifeline connection was lost. * reachability is determined solely on the basis of a shared subnet address/mask - more sophisticated algorithms (e.g., the one used in the tcp btl) are required to handle routing via gateways * the RML needs to assign sequence numbers to each message on a per-peer basis. The receiving RML will then deliver messages in order, thus preventing out-of-order messaging in the case where messages travel across different transports or a message needs to be redirected/resent due to failure of a NIC This commit was SVN r29058.
112 строки
4.6 KiB
C
112 строки
4.6 KiB
C
/*
|
|
* Copyright (c) 2004-2007 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 (c) 2006-2013 Los Alamos National Security, LLC.
|
|
* All rights reserved.
|
|
* Copyright (c) 2010-2011 Cisco Systems, Inc. All rights reserved.
|
|
* $COPYRIGHT$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* $HEADER$
|
|
*/
|
|
|
|
#ifndef _MCA_OOB_TCP_PEER_H_
|
|
#define _MCA_OOB_TCP_PEER_H_
|
|
|
|
#include "orte_config.h"
|
|
|
|
#include "oob_tcp.h"
|
|
#include "oob_tcp_sendrecv.h"
|
|
|
|
typedef struct {
|
|
opal_list_item_t super;
|
|
struct sockaddr_storage addr; // an address where a peer can be found
|
|
int retries; // number of times we have tried to connect to this address
|
|
mca_oob_tcp_state_t state; // state of this address
|
|
} mca_oob_tcp_addr_t;
|
|
OBJ_CLASS_DECLARATION(mca_oob_tcp_addr_t);
|
|
|
|
/* object for tracking peers in modules */
|
|
typedef struct {
|
|
opal_list_item_t super;
|
|
/* we frequently need access to
|
|
* the module (e.g., its event
|
|
* base) to activate subsequent peer states
|
|
*/
|
|
mca_oob_tcp_module_t *mod;
|
|
/* although not required, there is enough debug
|
|
* value that retaining the name makes sense
|
|
*/
|
|
orte_process_name_t name;
|
|
int sd;
|
|
opal_list_t addrs;
|
|
mca_oob_tcp_addr_t *active_addr;
|
|
mca_oob_tcp_state_t state;
|
|
opal_event_t send_event; /**< registration with event thread for send events */
|
|
bool send_ev_active;
|
|
opal_event_t recv_event; /**< registration with event thread for recv events */
|
|
bool recv_ev_active;
|
|
opal_event_t timer_event; /**< timer for retrying connection failures */
|
|
bool timer_ev_active;
|
|
opal_list_t send_queue; /**< list of messages to send */
|
|
mca_oob_tcp_send_t *send_msg; /**< current send in progress */
|
|
mca_oob_tcp_recv_t *recv_msg; /**< current recv in progress */
|
|
} mca_oob_tcp_peer_t;
|
|
OBJ_CLASS_DECLARATION(mca_oob_tcp_peer_t);
|
|
|
|
/* state machine for processing peer data */
|
|
typedef struct {
|
|
opal_object_t super;
|
|
opal_event_t ev;
|
|
mca_oob_tcp_module_t *mod;
|
|
orte_process_name_t peer;
|
|
uint16_t af_family;
|
|
char *net;
|
|
char *port;
|
|
} mca_oob_tcp_peer_op_t;
|
|
OBJ_CLASS_DECLARATION(mca_oob_tcp_peer_op_t);
|
|
|
|
#define ORTE_ACTIVATE_TCP_PEER_OP(m, p, a, n, pts, cbfunc) \
|
|
do { \
|
|
mca_oob_tcp_peer_op_t *pop; \
|
|
pop = OBJ_NEW(mca_oob_tcp_peer_op_t); \
|
|
pop->mod = (m); \
|
|
pop->peer.jobid = (p)->jobid; \
|
|
pop->peer.vpid = (p)->vpid; \
|
|
pop->af_family = (a); \
|
|
if (NULL != (n)) { \
|
|
pop->net = strdup((n)); \
|
|
} \
|
|
if (NULL != (pts)) { \
|
|
pop->port = strdup((pts)); \
|
|
} \
|
|
opal_event_set((m)->ev_base, &pop->ev, -1, \
|
|
OPAL_EV_WRITE, (cbfunc), pop); \
|
|
opal_event_set_priority(&pop->ev, ORTE_MSG_PRI); \
|
|
opal_event_active(&pop->ev, OPAL_EV_WRITE, 1); \
|
|
} while(0);
|
|
|
|
#define ORTE_ACTIVATE_TCP_CMP_OP(m, p, cbfunc) \
|
|
do { \
|
|
mca_oob_tcp_peer_op_t *pop; \
|
|
pop = OBJ_NEW(mca_oob_tcp_peer_op_t); \
|
|
pop->mod = (m); \
|
|
pop->peer.jobid = (p)->jobid; \
|
|
pop->peer.vpid = (p)->vpid; \
|
|
opal_event_set(orte_event_base, &pop->ev, -1, \
|
|
OPAL_EV_WRITE, (cbfunc), pop); \
|
|
opal_event_set_priority(&pop->ev, ORTE_MSG_PRI); \
|
|
opal_event_active(&pop->ev, OPAL_EV_WRITE, 1); \
|
|
} while(0);
|
|
|
|
#endif /* _MCA_OOB_TCP_PEER_H_ */
|