2007-12-21 09:02:00 +03:00
|
|
|
|
/* -*- Mode: C; c-basic-offset:4 ; -*- */
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/*
|
2007-03-17 02:11:45 +03:00
|
|
|
|
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
|
2005-11-05 22:57:48 +03:00
|
|
|
|
* University Research and Technology
|
|
|
|
|
* Corporation. All rights reserved.
|
2009-04-10 20:44:37 +04:00
|
|
|
|
* Copyright (c) 2004-2009 The University of Tennessee and The University
|
2005-11-05 22:57:48 +03:00
|
|
|
|
* of Tennessee Research Foundation. All rights
|
|
|
|
|
* reserved.
|
2008-01-21 15:11:18 +03:00
|
|
|
|
* Copyright (c) 2004-2007 High Performance Computing Center Stuttgart,
|
2005-07-01 01:28:35 +04:00
|
|
|
|
* University of Stuttgart. All rights reserved.
|
|
|
|
|
* Copyright (c) 2004-2005 The Regents of the University of California.
|
|
|
|
|
* All rights reserved.
|
2008-06-24 21:18:07 +04:00
|
|
|
|
* Copyright (c) 2006-2008 Cisco Systems, Inc. All rights reserved.
|
2009-03-25 19:53:26 +03:00
|
|
|
|
* Copyright (c) 2006-2009 Mellanox Technologies. All rights reserved.
|
2007-07-25 19:03:34 +04:00
|
|
|
|
* Copyright (c) 2006-2007 Los Alamos National Security, LLC. All rights
|
2008-01-21 15:11:18 +03:00
|
|
|
|
* reserved.
|
2007-09-24 14:11:52 +04:00
|
|
|
|
* Copyright (c) 2006-2007 Voltaire All rights reserved.
|
2010-05-24 22:57:55 +04:00
|
|
|
|
* Copyright (c) 2009-2010 Oracle and/or its affiliates. All rights reserved.
|
2005-07-01 01:28:35 +04:00
|
|
|
|
* $COPYRIGHT$
|
2008-01-21 15:11:18 +03:00
|
|
|
|
*
|
2005-07-01 01:28:35 +04:00
|
|
|
|
* Additional copyrights may follow
|
2008-01-21 15:11:18 +03:00
|
|
|
|
*
|
2005-07-01 01:28:35 +04:00
|
|
|
|
* $HEADER$
|
Bring over all the work from the /tmp/ib-hw-detect branch. In
addition to my design and testing, it was conceptually approved by
Gil, Gleb, Pasha, Brad, and Galen. Functionally [probably somewhat
lightly] tested by Galen. We may still have to shake out some bugs
during the next few months, but it seems to be working for all the
cases that I can throw at it.
Here's a summary of the changes from that branch:
* Move MCA parameter registration to a new file (btl_openib_mca.c):
* Properly check the retun status of registering MCA params
* Check for valid values of MCA parameters
* Make help strings better
* Otherwise, the only default value of an MCA param that was
changed was max_btls; it went from 4 to -1 (meaning: use all
available)
* Properly prototyped internal functions in _component.c
* Made a bunch of functions static that didn't need to be public
* Renamed to remove "mca_" prefix from static functions
* Call new MCA param registration function
* Call new INI file read/lookup/finalize functions
* Updated a bunch of macros to be "BTL_" instead of "ORTE_"
* Be a little more consistent with return values
* Handle -1 for the max_btls MCA param
* Fixed a free() that should have been an OBJ_RELEASE()
* Some re-indenting
* Added INI-file parsing
* New flex file: btl_openib_ini.l
* New default HCA params .ini file (probably to be expanded over
time by other HCA vendors)
* Added more show_help messages for parsing problems
* Read in INI files and cache the values for later lookup
* When component opens an HCA, lookup to see if any corresponding
values were found in the INI files (ID'ed by the HCA vendor_id
and vendor_part_id)
* Added btl_openib_verbose MCA param that shows what the INI-file
stuff does (e.g., shows which MTU your HCA ends up using)
* Added btl_openib_hca_param_files as a colon-delimited list of INI
files to check for values during startup (in order,
left-to-right, just like the MCA base directory param).
* MTU is currently the only value supported in this framework.
* It is not a fatal error if we don't find params for the HCA in
the INI file(s). Instead, just print a warning. New MCA param
btl_openib_warn_no_hca_params_found can be used to disable
printing the warning.
* Add MTU to peer negotiation when making a connection
* Exchange maximum MTU; select the lesser of the two
This commit was SVN r11182.
2006-08-14 23:30:37 +04:00
|
|
|
|
*
|
2005-07-01 01:28:35 +04:00
|
|
|
|
* @file
|
|
|
|
|
*/
|
Bring over all the work from the /tmp/ib-hw-detect branch. In
addition to my design and testing, it was conceptually approved by
Gil, Gleb, Pasha, Brad, and Galen. Functionally [probably somewhat
lightly] tested by Galen. We may still have to shake out some bugs
during the next few months, but it seems to be working for all the
cases that I can throw at it.
Here's a summary of the changes from that branch:
* Move MCA parameter registration to a new file (btl_openib_mca.c):
* Properly check the retun status of registering MCA params
* Check for valid values of MCA parameters
* Make help strings better
* Otherwise, the only default value of an MCA param that was
changed was max_btls; it went from 4 to -1 (meaning: use all
available)
* Properly prototyped internal functions in _component.c
* Made a bunch of functions static that didn't need to be public
* Renamed to remove "mca_" prefix from static functions
* Call new MCA param registration function
* Call new INI file read/lookup/finalize functions
* Updated a bunch of macros to be "BTL_" instead of "ORTE_"
* Be a little more consistent with return values
* Handle -1 for the max_btls MCA param
* Fixed a free() that should have been an OBJ_RELEASE()
* Some re-indenting
* Added INI-file parsing
* New flex file: btl_openib_ini.l
* New default HCA params .ini file (probably to be expanded over
time by other HCA vendors)
* Added more show_help messages for parsing problems
* Read in INI files and cache the values for later lookup
* When component opens an HCA, lookup to see if any corresponding
values were found in the INI files (ID'ed by the HCA vendor_id
and vendor_part_id)
* Added btl_openib_verbose MCA param that shows what the INI-file
stuff does (e.g., shows which MTU your HCA ends up using)
* Added btl_openib_hca_param_files as a colon-delimited list of INI
files to check for values during startup (in order,
left-to-right, just like the MCA base directory param).
* MTU is currently the only value supported in this framework.
* It is not a fatal error if we don't find params for the HCA in
the INI file(s). Instead, just print a warning. New MCA param
btl_openib_warn_no_hca_params_found can be used to disable
printing the warning.
* Add MTU to peer negotiation when making a connection
* Exchange maximum MTU; select the lesser of the two
This commit was SVN r11182.
2006-08-14 23:30:37 +04:00
|
|
|
|
|
2007-04-27 01:03:38 +04:00
|
|
|
|
#ifndef MCA_BTL_IB_H
|
|
|
|
|
#define MCA_BTL_IB_H
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
2009-03-04 18:35:54 +03:00
|
|
|
|
#include "ompi_config.h"
|
2005-07-01 01:28:35 +04:00
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
#include <string.h>
|
2006-06-28 11:23:08 +04:00
|
|
|
|
#include <infiniband/verbs.h>
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
|
|
|
|
/* Open MPI includes */
|
2006-02-12 04:33:29 +03:00
|
|
|
|
#include "ompi/class/ompi_free_list.h"
|
2007-12-21 09:02:00 +03:00
|
|
|
|
#include "opal/class/opal_pointer_array.h"
|
2009-04-29 04:49:23 +04:00
|
|
|
|
#include "opal/class/opal_hash_table.h"
|
2009-02-14 05:26:12 +03:00
|
|
|
|
#include "opal/util/output.h"
|
Update libevent to the 2.0 series, currently at 2.0.7rc. We will update to their final release when it becomes available. Currently known errors exist in unused portions of the libevent code. This revision passes the IBM test suite on a Linux machine and on a standalone Mac.
This is a fairly intrusive change, but outside of the moving of opal/event to opal/mca/event, the only changes involved (a) changing all calls to opal_event functions to reflect the new framework instead, and (b) ensuring that all opal_event_t objects are properly constructed since they are now true opal_objects.
Note: Shiqing has just returned from vacation and has not yet had a chance to complete the Windows integration. Thus, this commit almost certainly breaks Windows support on the trunk. However, I want this to have a chance to soak for as long as possible before I become less available a week from today (going to be at a class for 5 days, and thus will only be sparingly available) so we can find and fix any problems.
Biggest change is moving the libevent code from opal/event to a new opal/mca/event framework. This was done to make it much easier to update libevent in the future. New versions can be inserted as a new component and tested in parallel with the current version until validated, then we can remove the earlier version if we so choose. This is a statically built framework ala installdirs, so only one component will build at a time. There is no selection logic - the sole compiled component simply loads its function pointers into the opal_event struct.
I have gone thru the code base and converted all the libevent calls I could find. However, I cannot compile nor test every environment. It is therefore quite likely that errors remain in the system. Please keep an eye open for two things:
1. compile-time errors: these will be obvious as calls to the old functions (e.g., opal_evtimer_new) must be replaced by the new framework APIs (e.g., opal_event.evtimer_new)
2. run-time errors: these will likely show up as segfaults due to missing constructors on opal_event_t objects. It appears that it became a typical practice for people to "init" an opal_event_t by simply using memset to zero it out. This will no longer work - you must either OBJ_NEW or OBJ_CONSTRUCT an opal_event_t. I tried to catch these cases, but may have missed some. Believe me, you'll know when you hit it.
There is also the issue of the new libevent "no recursion" behavior. As I described on a recent email, we will have to discuss this and figure out what, if anything, we need to do.
This commit was SVN r23925.
2010-10-24 22:35:54 +04:00
|
|
|
|
#include "opal/mca/event/event.h"
|
2009-11-27 17:49:24 +03:00
|
|
|
|
#include "opal/threads/threads.h"
|
2006-02-12 04:33:29 +03:00
|
|
|
|
#include "ompi/mca/btl/btl.h"
|
2008-01-21 15:11:18 +03:00
|
|
|
|
#include "ompi/mca/mpool/mpool.h"
|
|
|
|
|
#include "ompi/mca/btl/base/btl_base_error.h"
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
2006-02-12 04:33:29 +03:00
|
|
|
|
#include "ompi/mca/btl/btl.h"
|
2008-01-21 15:11:18 +03:00
|
|
|
|
#include "ompi/mca/btl/base/base.h"
|
2006-09-07 17:05:41 +04:00
|
|
|
|
|
2008-01-15 02:22:03 +03:00
|
|
|
|
#include "connect/connect.h"
|
|
|
|
|
|
2007-06-14 05:59:25 +04:00
|
|
|
|
BEGIN_C_DECLS
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
2008-07-08 10:32:54 +04:00
|
|
|
|
#define HAVE_XRC (1 == OMPI_HAVE_CONNECTX_XRC)
|
2007-11-28 10:18:59 +03:00
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
#define MCA_BTL_IB_LEAVE_PINNED 1
|
2006-09-26 16:12:33 +04:00
|
|
|
|
#define IB_DEFAULT_GID_PREFIX 0xfe80000000000000ll
|
2008-10-08 13:56:43 +04:00
|
|
|
|
#define MCA_BTL_IB_PKEY_MASK 0x7fff
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
|
2008-05-02 15:52:33 +04:00
|
|
|
|
/*--------------------------------------------------------------------*/
|
|
|
|
|
|
2009-05-07 00:11:28 +04:00
|
|
|
|
#if OPAL_ENABLE_DEBUG
|
2008-05-02 15:52:33 +04:00
|
|
|
|
#define ATTACH() do { \
|
|
|
|
|
int i = 0; \
|
2008-06-09 18:53:58 +04:00
|
|
|
|
opal_output(0, "WAITING TO DEBUG ATTACH"); \
|
2008-05-02 15:52:33 +04:00
|
|
|
|
while (i == 0) sleep(5); \
|
|
|
|
|
} while(0);
|
|
|
|
|
#else
|
|
|
|
|
#define ATTACH()
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*--------------------------------------------------------------------*/
|
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/**
|
|
|
|
|
* Infiniband (IB) BTL component.
|
|
|
|
|
*/
|
|
|
|
|
|
2009-12-15 17:25:07 +03:00
|
|
|
|
typedef enum {
|
|
|
|
|
MCA_BTL_OPENIB_TRANSPORT_IB,
|
|
|
|
|
MCA_BTL_OPENIB_TRANSPORT_IWARP,
|
|
|
|
|
MCA_BTL_OPENIB_TRANSPORT_RDMAOE,
|
|
|
|
|
MCA_BTL_OPENIB_TRANSPORT_UNKNOWN,
|
|
|
|
|
MCA_BTL_OPENIB_TRANSPORT_SIZE
|
|
|
|
|
} mca_btl_openib_transport_type_t;
|
|
|
|
|
|
2008-01-21 15:11:18 +03:00
|
|
|
|
typedef enum {
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
MCA_BTL_OPENIB_PP_QP,
|
2007-11-28 10:18:59 +03:00
|
|
|
|
MCA_BTL_OPENIB_SRQ_QP,
|
|
|
|
|
MCA_BTL_OPENIB_XRC_QP
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
} mca_btl_openib_qp_type_t;
|
|
|
|
|
|
|
|
|
|
struct mca_btl_openib_pp_qp_info_t {
|
|
|
|
|
int32_t rd_win;
|
|
|
|
|
int32_t rd_rsv;
|
|
|
|
|
}; typedef struct mca_btl_openib_pp_qp_info_t mca_btl_openib_pp_qp_info_t;
|
|
|
|
|
|
|
|
|
|
struct mca_btl_openib_srq_qp_info_t {
|
|
|
|
|
int32_t sd_max;
|
2009-12-15 18:52:10 +03:00
|
|
|
|
/* The init value for rd_curr_num variables of all SRQs */
|
|
|
|
|
int32_t rd_init;
|
|
|
|
|
/* The watermark, threshold - if the number of WQEs in SRQ is less then this value =>
|
|
|
|
|
the SRQ limit event (IBV_EVENT_SRQ_LIMIT_REACHED) will be generated on corresponding SRQ.
|
|
|
|
|
As result the maximal number of pre-posted WQEs on the SRQ will be increased */
|
|
|
|
|
int32_t srq_limit;
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
}; typedef struct mca_btl_openib_srq_qp_info_t mca_btl_openib_srq_qp_info_t;
|
|
|
|
|
|
|
|
|
|
struct mca_btl_openib_qp_info_t {
|
2007-09-30 20:14:17 +04:00
|
|
|
|
mca_btl_openib_qp_type_t type;
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
size_t size;
|
|
|
|
|
int32_t rd_num;
|
|
|
|
|
int32_t rd_low;
|
2008-01-21 15:11:18 +03:00
|
|
|
|
union {
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
mca_btl_openib_pp_qp_info_t pp_qp;
|
|
|
|
|
mca_btl_openib_srq_qp_info_t srq_qp;
|
2008-01-21 15:11:18 +03:00
|
|
|
|
} u;
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
}; typedef struct mca_btl_openib_qp_info_t mca_btl_openib_qp_info_t;
|
|
|
|
|
|
2007-09-30 20:14:17 +04:00
|
|
|
|
#define BTL_OPENIB_QP_TYPE(Q) (mca_btl_openib_component.qp_infos[(Q)].type)
|
|
|
|
|
#define BTL_OPENIB_QP_TYPE_PP(Q) \
|
|
|
|
|
(BTL_OPENIB_QP_TYPE(Q) == MCA_BTL_OPENIB_PP_QP)
|
|
|
|
|
#define BTL_OPENIB_QP_TYPE_SRQ(Q) \
|
|
|
|
|
(BTL_OPENIB_QP_TYPE(Q) == MCA_BTL_OPENIB_SRQ_QP)
|
2007-11-28 10:18:59 +03:00
|
|
|
|
#define BTL_OPENIB_QP_TYPE_XRC(Q) \
|
|
|
|
|
(BTL_OPENIB_QP_TYPE(Q) == MCA_BTL_OPENIB_XRC_QP)
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
|
2008-05-21 01:53:42 +04:00
|
|
|
|
typedef enum {
|
|
|
|
|
BTL_OPENIB_RQ_SOURCE_DEFAULT,
|
|
|
|
|
BTL_OPENIB_RQ_SOURCE_MCA,
|
2008-07-23 04:28:59 +04:00
|
|
|
|
BTL_OPENIB_RQ_SOURCE_DEVICE_INI,
|
|
|
|
|
BTL_OPENIB_RQ_SOURCE_MAX
|
2008-05-21 01:53:42 +04:00
|
|
|
|
} btl_openib_receive_queues_source_t;
|
|
|
|
|
|
2008-10-06 04:46:02 +04:00
|
|
|
|
typedef enum {
|
|
|
|
|
BTL_OPENIB_DT_IB,
|
|
|
|
|
BTL_OPENIB_DT_IWARP,
|
|
|
|
|
BTL_OPENIB_DT_ALL
|
|
|
|
|
} btl_openib_device_type_t;
|
|
|
|
|
|
2010-02-18 12:48:16 +03:00
|
|
|
|
#if OPAL_HAVE_THREADS
|
|
|
|
|
/* The structer for manage all BTL SRQs */
|
|
|
|
|
typedef struct mca_btl_openib_srq_manager_t {
|
|
|
|
|
opal_mutex_t lock;
|
|
|
|
|
/* The keys of this hash table are addresses of
|
|
|
|
|
SRQs structures, and the elements are BTL modules
|
|
|
|
|
pointers that associated with these SRQs */
|
|
|
|
|
opal_hash_table_t srq_addr_table;
|
|
|
|
|
} mca_btl_openib_srq_manager_t;
|
|
|
|
|
#endif
|
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
struct mca_btl_openib_component_t {
|
2008-07-29 02:40:57 +04:00
|
|
|
|
mca_btl_base_component_2_0_0_t super; /**< base BTL component */
|
2006-03-13 20:03:21 +03:00
|
|
|
|
|
|
|
|
|
int ib_max_btls;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
/**< maximum number of devices available to openib component */
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
2006-06-01 06:32:18 +04:00
|
|
|
|
int ib_num_btls;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
/**< number of devices available to the openib component */
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
2007-05-09 01:47:21 +04:00
|
|
|
|
struct mca_btl_openib_module_t **openib_btls;
|
2007-04-27 01:03:38 +04:00
|
|
|
|
/**< array of available BTLs */
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
2008-07-23 04:28:59 +04:00
|
|
|
|
opal_pointer_array_t devices; /**< array of available devices */
|
|
|
|
|
int devices_count;
|
2007-08-22 13:31:12 +04:00
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
int ib_free_list_num;
|
|
|
|
|
/**< initial size of free lists */
|
|
|
|
|
|
|
|
|
|
int ib_free_list_max;
|
|
|
|
|
/**< maximum size of free lists */
|
|
|
|
|
|
|
|
|
|
int ib_free_list_inc;
|
|
|
|
|
/**< number of elements to alloc when growing free lists */
|
|
|
|
|
|
2005-07-03 20:22:16 +04:00
|
|
|
|
opal_list_t ib_procs;
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/**< list of ib proc structures */
|
|
|
|
|
|
2005-07-04 03:09:55 +04:00
|
|
|
|
opal_event_t ib_send_event;
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/**< event structure for sends */
|
|
|
|
|
|
2005-07-04 03:09:55 +04:00
|
|
|
|
opal_event_t ib_recv_event;
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/**< event structure for recvs */
|
|
|
|
|
|
2005-07-04 02:45:48 +04:00
|
|
|
|
opal_mutex_t ib_lock;
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/**< lock for accessing module state */
|
|
|
|
|
|
2008-01-21 15:11:18 +03:00
|
|
|
|
char* ib_mpool_name;
|
|
|
|
|
/**< name of ib memory pool */
|
2007-04-27 01:03:38 +04:00
|
|
|
|
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
uint8_t num_pp_qps; /**< number of pp qp's */
|
|
|
|
|
uint8_t num_srq_qps; /**< number of srq qp's */
|
2007-11-28 10:18:59 +03:00
|
|
|
|
uint8_t num_xrc_qps; /**< number of xrc qp's */
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
uint8_t num_qps; /**< total number of qp's */
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
2007-11-28 10:18:59 +03:00
|
|
|
|
opal_hash_table_t ib_addr_table; /**< used only for xrc.hash-table that
|
|
|
|
|
keeps table of all lids/subnets */
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
mca_btl_openib_qp_info_t* qp_infos;
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
2007-04-27 01:03:38 +04:00
|
|
|
|
size_t eager_limit; /**< Eager send limit of first fragment, in Bytes */
|
|
|
|
|
size_t max_send_size; /**< Maximum send size, in Bytes */
|
2010-12-23 14:48:43 +03:00
|
|
|
|
int32_t max_hw_msg_size; /**< Maximum message size for RDMA protocols in Bytes */
|
2007-04-27 01:03:38 +04:00
|
|
|
|
uint32_t reg_mru_len; /**< Length of the registration cache most recently used list */
|
2008-01-21 15:11:18 +03:00
|
|
|
|
uint32_t use_srq; /**< Use the Shared Receive Queue (SRQ mode) */
|
|
|
|
|
|
|
|
|
|
uint32_t ib_cq_size[2]; /**< Max outstanding CQE on the CQ */
|
|
|
|
|
|
2008-06-24 21:18:07 +04:00
|
|
|
|
int32_t ib_max_inline_data; /**< Max size of inline data */
|
2007-04-22 14:22:12 +04:00
|
|
|
|
uint32_t ib_pkey_val;
|
2008-01-21 15:11:18 +03:00
|
|
|
|
uint32_t ib_psn;
|
|
|
|
|
uint32_t ib_qp_ous_rd_atom;
|
|
|
|
|
uint32_t ib_mtu;
|
|
|
|
|
uint32_t ib_min_rnr_timer;
|
|
|
|
|
uint32_t ib_timeout;
|
|
|
|
|
uint32_t ib_retry_count;
|
|
|
|
|
uint32_t ib_rnr_retry;
|
|
|
|
|
uint32_t ib_max_rdma_dst_ops;
|
|
|
|
|
uint32_t ib_service_level;
|
2010-12-30 11:20:24 +03:00
|
|
|
|
uint32_t ib_path_rec_service_level;
|
2008-06-24 22:31:46 +04:00
|
|
|
|
int32_t use_eager_rdma;
|
2007-04-27 01:03:38 +04:00
|
|
|
|
int32_t eager_rdma_threshold; /**< After this number of msg, use RDMA for short messages, always */
|
2007-08-27 15:37:01 +04:00
|
|
|
|
int32_t eager_rdma_num;
|
2006-10-31 20:29:25 +03:00
|
|
|
|
int32_t max_eager_rdma;
|
2006-06-28 11:23:08 +04:00
|
|
|
|
uint32_t btls_per_lid;
|
|
|
|
|
uint32_t max_lmc;
|
2008-02-20 16:44:05 +03:00
|
|
|
|
int32_t apm_lmc;
|
|
|
|
|
int32_t apm_ports;
|
2007-04-27 01:03:38 +04:00
|
|
|
|
uint32_t buffer_alignment; /**< Preferred communication buffer alignment in Bytes (must be power of two) */
|
2009-05-07 00:11:28 +04:00
|
|
|
|
#if OPAL_HAVE_THREADS
|
2010-05-24 22:57:55 +04:00
|
|
|
|
int32_t error_counter; /**< Counts number on error events that we got on all devices */
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
int async_pipe[2]; /**< Pipe for comunication with async event thread */
|
2008-07-13 20:21:49 +04:00
|
|
|
|
int async_comp_pipe[2]; /**< Pipe for async thread comunication with main thread */
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
pthread_t async_thread; /**< Async thread that will handle fatal errors */
|
2008-01-21 15:11:18 +03:00
|
|
|
|
uint32_t use_async_event_thread; /**< Use the async event handler */
|
2010-02-18 12:48:16 +03:00
|
|
|
|
mca_btl_openib_srq_manager_t srq_manager; /**< Hash table for all BTL SRQs */
|
2010-07-14 14:08:19 +04:00
|
|
|
|
#if OMPI_OPENIB_FAILOVER_ENABLED
|
|
|
|
|
uint32_t port_error_failover; /**< Report port errors to speed up failover */
|
|
|
|
|
#endif
|
2007-05-09 01:47:21 +04:00
|
|
|
|
#endif
|
2008-10-06 04:46:02 +04:00
|
|
|
|
btl_openib_device_type_t device_type;
|
2007-06-14 05:59:25 +04:00
|
|
|
|
char *if_include;
|
|
|
|
|
char **if_include_list;
|
|
|
|
|
char *if_exclude;
|
|
|
|
|
char **if_exclude_list;
|
2008-11-17 23:20:24 +03:00
|
|
|
|
char *ipaddr_include;
|
|
|
|
|
char *ipaddr_exclude;
|
2005-07-15 19:13:19 +04:00
|
|
|
|
|
2008-05-21 01:53:42 +04:00
|
|
|
|
/* MCA param btl_openib_receive_queues */
|
|
|
|
|
char *receive_queues;
|
|
|
|
|
/* Whether we got a non-default value of btl_openib_receive_queues */
|
|
|
|
|
btl_openib_receive_queues_source_t receive_queues_source;
|
|
|
|
|
|
2008-07-23 04:28:59 +04:00
|
|
|
|
/** Colon-delimited list of filenames for device parameters */
|
|
|
|
|
char *device_params_file_names;
|
Bring over all the work from the /tmp/ib-hw-detect branch. In
addition to my design and testing, it was conceptually approved by
Gil, Gleb, Pasha, Brad, and Galen. Functionally [probably somewhat
lightly] tested by Galen. We may still have to shake out some bugs
during the next few months, but it seems to be working for all the
cases that I can throw at it.
Here's a summary of the changes from that branch:
* Move MCA parameter registration to a new file (btl_openib_mca.c):
* Properly check the retun status of registering MCA params
* Check for valid values of MCA parameters
* Make help strings better
* Otherwise, the only default value of an MCA param that was
changed was max_btls; it went from 4 to -1 (meaning: use all
available)
* Properly prototyped internal functions in _component.c
* Made a bunch of functions static that didn't need to be public
* Renamed to remove "mca_" prefix from static functions
* Call new MCA param registration function
* Call new INI file read/lookup/finalize functions
* Updated a bunch of macros to be "BTL_" instead of "ORTE_"
* Be a little more consistent with return values
* Handle -1 for the max_btls MCA param
* Fixed a free() that should have been an OBJ_RELEASE()
* Some re-indenting
* Added INI-file parsing
* New flex file: btl_openib_ini.l
* New default HCA params .ini file (probably to be expanded over
time by other HCA vendors)
* Added more show_help messages for parsing problems
* Read in INI files and cache the values for later lookup
* When component opens an HCA, lookup to see if any corresponding
values were found in the INI files (ID'ed by the HCA vendor_id
and vendor_part_id)
* Added btl_openib_verbose MCA param that shows what the INI-file
stuff does (e.g., shows which MTU your HCA ends up using)
* Added btl_openib_hca_param_files as a colon-delimited list of INI
files to check for values during startup (in order,
left-to-right, just like the MCA base directory param).
* MTU is currently the only value supported in this framework.
* It is not a fatal error if we don't find params for the HCA in
the INI file(s). Instead, just print a warning. New MCA param
btl_openib_warn_no_hca_params_found can be used to disable
printing the warning.
* Add MTU to peer negotiation when making a connection
* Exchange maximum MTU; select the lesser of the two
This commit was SVN r11182.
2006-08-14 23:30:37 +04:00
|
|
|
|
|
|
|
|
|
/** Whether we're in verbose mode or not */
|
|
|
|
|
bool verbose;
|
|
|
|
|
|
2008-07-23 04:28:59 +04:00
|
|
|
|
/** Whether we want a warning if no device-specific parameters are
|
Bring over all the work from the /tmp/ib-hw-detect branch. In
addition to my design and testing, it was conceptually approved by
Gil, Gleb, Pasha, Brad, and Galen. Functionally [probably somewhat
lightly] tested by Galen. We may still have to shake out some bugs
during the next few months, but it seems to be working for all the
cases that I can throw at it.
Here's a summary of the changes from that branch:
* Move MCA parameter registration to a new file (btl_openib_mca.c):
* Properly check the retun status of registering MCA params
* Check for valid values of MCA parameters
* Make help strings better
* Otherwise, the only default value of an MCA param that was
changed was max_btls; it went from 4 to -1 (meaning: use all
available)
* Properly prototyped internal functions in _component.c
* Made a bunch of functions static that didn't need to be public
* Renamed to remove "mca_" prefix from static functions
* Call new MCA param registration function
* Call new INI file read/lookup/finalize functions
* Updated a bunch of macros to be "BTL_" instead of "ORTE_"
* Be a little more consistent with return values
* Handle -1 for the max_btls MCA param
* Fixed a free() that should have been an OBJ_RELEASE()
* Some re-indenting
* Added INI-file parsing
* New flex file: btl_openib_ini.l
* New default HCA params .ini file (probably to be expanded over
time by other HCA vendors)
* Added more show_help messages for parsing problems
* Read in INI files and cache the values for later lookup
* When component opens an HCA, lookup to see if any corresponding
values were found in the INI files (ID'ed by the HCA vendor_id
and vendor_part_id)
* Added btl_openib_verbose MCA param that shows what the INI-file
stuff does (e.g., shows which MTU your HCA ends up using)
* Added btl_openib_hca_param_files as a colon-delimited list of INI
files to check for values during startup (in order,
left-to-right, just like the MCA base directory param).
* MTU is currently the only value supported in this framework.
* It is not a fatal error if we don't find params for the HCA in
the INI file(s). Instead, just print a warning. New MCA param
btl_openib_warn_no_hca_params_found can be used to disable
printing the warning.
* Add MTU to peer negotiation when making a connection
* Exchange maximum MTU; select the lesser of the two
This commit was SVN r11182.
2006-08-14 23:30:37 +04:00
|
|
|
|
found in INI files */
|
2008-07-23 04:28:59 +04:00
|
|
|
|
bool warn_no_device_params_found;
|
2006-09-26 16:12:33 +04:00
|
|
|
|
/** Whether we want a warning if non default GID prefix is not configured
|
|
|
|
|
on multiport setup */
|
|
|
|
|
bool warn_default_gid_prefix;
|
2007-06-14 05:59:25 +04:00
|
|
|
|
/** Whether we want a warning if the user specifies a non-existent
|
2008-07-23 04:28:59 +04:00
|
|
|
|
device and/or port via btl_openib_if_[in|ex]clude MCA params */
|
2007-06-14 05:59:25 +04:00
|
|
|
|
bool warn_nonexistent_if;
|
|
|
|
|
/** Dummy argv-style list; a copy of names from the
|
|
|
|
|
if_[in|ex]clude list that we use for error checking (to ensure
|
|
|
|
|
that they all exist) */
|
|
|
|
|
char **if_list;
|
2007-12-09 17:05:13 +03:00
|
|
|
|
bool use_message_coalescing;
|
2007-12-23 15:29:34 +03:00
|
|
|
|
uint32_t cq_poll_ratio;
|
|
|
|
|
uint32_t cq_poll_progress;
|
|
|
|
|
uint32_t eager_rdma_poll_ratio;
|
2007-04-21 04:15:05 +04:00
|
|
|
|
#ifdef HAVE_IBV_FORK_INIT
|
|
|
|
|
/** Whether we want fork support or not */
|
|
|
|
|
int want_fork_support;
|
|
|
|
|
#endif
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
int rdma_qp;
|
2007-11-28 10:13:34 +03:00
|
|
|
|
int credits_qp; /* qp used for software flow control */
|
2008-07-10 19:08:49 +04:00
|
|
|
|
bool cpc_explicitly_defined;
|
2008-01-09 13:26:21 +03:00
|
|
|
|
/**< free list of frags only; used for pining user memory */
|
|
|
|
|
ompi_free_list_t send_user_free;
|
|
|
|
|
/**< free list of frags only; used for pining user memory */
|
|
|
|
|
ompi_free_list_t recv_user_free;
|
|
|
|
|
/**< frags for coalesced massages */
|
|
|
|
|
ompi_free_list_t send_free_coalesced;
|
2009-12-15 17:25:07 +03:00
|
|
|
|
/** Default receive queues */
|
|
|
|
|
char* default_recv_qps;
|
2009-12-15 18:52:10 +03:00
|
|
|
|
/** Whether we want a dynamically resizing srq, enabled by default */
|
|
|
|
|
bool enable_srq_resize;
|
2010-07-14 14:08:19 +04:00
|
|
|
|
#if OMPI_OPENIB_FAILOVER_ENABLED
|
|
|
|
|
int verbose_failover;
|
|
|
|
|
#endif
|
2005-07-01 01:28:35 +04:00
|
|
|
|
}; typedef struct mca_btl_openib_component_t mca_btl_openib_component_t;
|
|
|
|
|
|
2006-09-15 02:19:39 +04:00
|
|
|
|
OMPI_MODULE_DECLSPEC extern mca_btl_openib_component_t mca_btl_openib_component;
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
2008-01-21 15:11:18 +03:00
|
|
|
|
typedef mca_btl_base_recv_reg_t mca_btl_openib_recv_reg_t;
|
|
|
|
|
|
2008-05-02 15:52:33 +04:00
|
|
|
|
/**
|
|
|
|
|
* Common information for all ports that is sent in the modex message
|
|
|
|
|
*/
|
|
|
|
|
typedef struct mca_btl_openib_modex_message_t {
|
|
|
|
|
/** The subnet ID of this port */
|
2007-01-13 01:42:20 +03:00
|
|
|
|
uint64_t subnet_id;
|
2008-05-02 15:52:33 +04:00
|
|
|
|
/** LID of this port */
|
|
|
|
|
uint16_t lid;
|
|
|
|
|
/** APM LID for this port */
|
|
|
|
|
uint16_t apm_lid;
|
|
|
|
|
/** The MTU used by this port */
|
|
|
|
|
uint8_t mtu;
|
2009-12-15 17:25:07 +03:00
|
|
|
|
/** vendor id define device type and tuning */
|
|
|
|
|
uint32_t vendor_id;
|
|
|
|
|
/** vendor part id define device type and tuning */
|
|
|
|
|
uint32_t vendor_part_id;
|
|
|
|
|
/** Transport type of remote port */
|
|
|
|
|
uint8_t transport_type;
|
2008-05-02 15:52:33 +04:00
|
|
|
|
/** Dummy field used to calculate the real length */
|
|
|
|
|
uint8_t end;
|
|
|
|
|
} mca_btl_openib_modex_message_t;
|
|
|
|
|
|
|
|
|
|
#define MCA_BTL_OPENIB_MODEX_MSG_NTOH(hdr) \
|
2007-01-13 02:14:45 +03:00
|
|
|
|
do { \
|
2007-01-13 17:22:42 +03:00
|
|
|
|
(hdr).subnet_id = ntoh64((hdr).subnet_id); \
|
2008-05-02 15:52:33 +04:00
|
|
|
|
(hdr).lid = ntohs((hdr).lid); \
|
2007-01-13 02:14:45 +03:00
|
|
|
|
} while (0)
|
2008-05-02 15:52:33 +04:00
|
|
|
|
#define MCA_BTL_OPENIB_MODEX_MSG_HTON(hdr) \
|
2007-01-13 02:14:45 +03:00
|
|
|
|
do { \
|
2007-01-13 17:22:42 +03:00
|
|
|
|
(hdr).subnet_id = hton64((hdr).subnet_id); \
|
2008-05-02 15:52:33 +04:00
|
|
|
|
(hdr).lid = htons((hdr).lid); \
|
2007-01-13 02:14:45 +03:00
|
|
|
|
} while (0)
|
|
|
|
|
|
2008-07-23 04:28:59 +04:00
|
|
|
|
typedef struct mca_btl_openib_device_qp_t {
|
2008-01-09 13:26:21 +03:00
|
|
|
|
ompi_free_list_t send_free; /**< free lists of send buffer descriptors */
|
|
|
|
|
ompi_free_list_t recv_free; /**< free lists of receive buffer descriptors */
|
2008-07-23 04:28:59 +04:00
|
|
|
|
} mca_btl_openib_device_qp_t;
|
2008-01-09 13:26:21 +03:00
|
|
|
|
|
2007-12-23 15:29:34 +03:00
|
|
|
|
struct mca_btl_base_endpoint_t;
|
|
|
|
|
|
2008-07-23 04:28:59 +04:00
|
|
|
|
typedef struct mca_btl_openib_device_t {
|
2007-12-23 15:29:34 +03:00
|
|
|
|
opal_object_t super;
|
2006-06-28 11:23:08 +04:00
|
|
|
|
struct ibv_device *ib_dev; /* the ib device */
|
Update libevent to the 2.0 series, currently at 2.0.7rc. We will update to their final release when it becomes available. Currently known errors exist in unused portions of the libevent code. This revision passes the IBM test suite on a Linux machine and on a standalone Mac.
This is a fairly intrusive change, but outside of the moving of opal/event to opal/mca/event, the only changes involved (a) changing all calls to opal_event functions to reflect the new framework instead, and (b) ensuring that all opal_event_t objects are properly constructed since they are now true opal_objects.
Note: Shiqing has just returned from vacation and has not yet had a chance to complete the Windows integration. Thus, this commit almost certainly breaks Windows support on the trunk. However, I want this to have a chance to soak for as long as possible before I become less available a week from today (going to be at a class for 5 days, and thus will only be sparingly available) so we can find and fix any problems.
Biggest change is moving the libevent code from opal/event to a new opal/mca/event framework. This was done to make it much easier to update libevent in the future. New versions can be inserted as a new component and tested in parallel with the current version until validated, then we can remove the earlier version if we so choose. This is a statically built framework ala installdirs, so only one component will build at a time. There is no selection logic - the sole compiled component simply loads its function pointers into the opal_event struct.
I have gone thru the code base and converted all the libevent calls I could find. However, I cannot compile nor test every environment. It is therefore quite likely that errors remain in the system. Please keep an eye open for two things:
1. compile-time errors: these will be obvious as calls to the old functions (e.g., opal_evtimer_new) must be replaced by the new framework APIs (e.g., opal_event.evtimer_new)
2. run-time errors: these will likely show up as segfaults due to missing constructors on opal_event_t objects. It appears that it became a typical practice for people to "init" an opal_event_t by simply using memset to zero it out. This will no longer work - you must either OBJ_NEW or OBJ_CONSTRUCT an opal_event_t. I tried to catch these cases, but may have missed some. Believe me, you'll know when you hit it.
There is also the issue of the new libevent "no recursion" behavior. As I described on a recent email, we will have to discuss this and figure out what, if anything, we need to do.
This commit was SVN r23925.
2010-10-24 22:35:54 +04:00
|
|
|
|
#if OMPI_ENABLE_PROGRESS_THREADS == 1
|
2008-07-23 04:28:59 +04:00
|
|
|
|
struct ibv_comp_channel *ib_channel; /* Channel event for the device */
|
2006-11-02 19:15:21 +03:00
|
|
|
|
opal_thread_t thread; /* Progress thread */
|
|
|
|
|
volatile bool progress; /* Progress status */
|
|
|
|
|
#endif
|
2008-07-23 04:28:59 +04:00
|
|
|
|
opal_mutex_t device_lock; /* device level lock */
|
2006-06-28 11:23:08 +04:00
|
|
|
|
struct ibv_context *ib_dev_context;
|
|
|
|
|
struct ibv_device_attr ib_dev_attr;
|
|
|
|
|
struct ibv_pd *ib_pd;
|
2007-08-20 16:28:25 +04:00
|
|
|
|
struct ibv_cq *ib_cq[2];
|
|
|
|
|
uint32_t cq_size[2];
|
2006-06-28 11:23:08 +04:00
|
|
|
|
mca_mpool_base_module_t *mpool;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
/* MTU for this device */
|
Bring over all the work from the /tmp/ib-hw-detect branch. In
addition to my design and testing, it was conceptually approved by
Gil, Gleb, Pasha, Brad, and Galen. Functionally [probably somewhat
lightly] tested by Galen. We may still have to shake out some bugs
during the next few months, but it seems to be working for all the
cases that I can throw at it.
Here's a summary of the changes from that branch:
* Move MCA parameter registration to a new file (btl_openib_mca.c):
* Properly check the retun status of registering MCA params
* Check for valid values of MCA parameters
* Make help strings better
* Otherwise, the only default value of an MCA param that was
changed was max_btls; it went from 4 to -1 (meaning: use all
available)
* Properly prototyped internal functions in _component.c
* Made a bunch of functions static that didn't need to be public
* Renamed to remove "mca_" prefix from static functions
* Call new MCA param registration function
* Call new INI file read/lookup/finalize functions
* Updated a bunch of macros to be "BTL_" instead of "ORTE_"
* Be a little more consistent with return values
* Handle -1 for the max_btls MCA param
* Fixed a free() that should have been an OBJ_RELEASE()
* Some re-indenting
* Added INI-file parsing
* New flex file: btl_openib_ini.l
* New default HCA params .ini file (probably to be expanded over
time by other HCA vendors)
* Added more show_help messages for parsing problems
* Read in INI files and cache the values for later lookup
* When component opens an HCA, lookup to see if any corresponding
values were found in the INI files (ID'ed by the HCA vendor_id
and vendor_part_id)
* Added btl_openib_verbose MCA param that shows what the INI-file
stuff does (e.g., shows which MTU your HCA ends up using)
* Added btl_openib_hca_param_files as a colon-delimited list of INI
files to check for values during startup (in order,
left-to-right, just like the MCA base directory param).
* MTU is currently the only value supported in this framework.
* It is not a fatal error if we don't find params for the HCA in
the INI file(s). Instead, just print a warning. New MCA param
btl_openib_warn_no_hca_params_found can be used to disable
printing the warning.
* Add MTU to peer negotiation when making a connection
* Exchange maximum MTU; select the lesser of the two
This commit was SVN r11182.
2006-08-14 23:30:37 +04:00
|
|
|
|
uint32_t mtu;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
/* Whether this device supports eager RDMA */
|
2006-12-14 18:52:13 +03:00
|
|
|
|
uint8_t use_eager_rdma;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
uint8_t btls; /** < number of btls using this device */
|
2007-12-21 09:02:00 +03:00
|
|
|
|
opal_pointer_array_t *endpoints;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
opal_pointer_array_t *device_btls;
|
2007-12-23 15:29:34 +03:00
|
|
|
|
uint16_t hp_cq_polls;
|
|
|
|
|
uint16_t eager_rdma_polls;
|
|
|
|
|
bool pollme;
|
2009-05-07 00:11:28 +04:00
|
|
|
|
#if OPAL_HAVE_THREADS
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
volatile bool got_fatal_event;
|
2010-05-24 22:57:55 +04:00
|
|
|
|
volatile bool got_port_event;
|
2007-05-09 01:47:21 +04:00
|
|
|
|
#endif
|
2007-11-28 10:18:59 +03:00
|
|
|
|
#if HAVE_XRC
|
|
|
|
|
struct ibv_xrc_domain *xrc_domain;
|
|
|
|
|
int xrc_fd;
|
|
|
|
|
#endif
|
2008-01-21 18:07:39 +03:00
|
|
|
|
int32_t non_eager_rdma_endpoints;
|
2007-12-23 15:29:34 +03:00
|
|
|
|
int32_t eager_rdma_buffers_count;
|
|
|
|
|
struct mca_btl_base_endpoint_t **eager_rdma_buffers;
|
2008-01-09 13:26:21 +03:00
|
|
|
|
/**< frags for control massages */
|
|
|
|
|
ompi_free_list_t send_free_control;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
/* QP types and attributes that will be used on this device */
|
|
|
|
|
mca_btl_openib_device_qp_t *qps;
|
|
|
|
|
/* Maximum value supported by this device for max_inline_data */
|
2008-06-24 21:18:07 +04:00
|
|
|
|
uint32_t max_inline_data;
|
2008-07-23 04:28:59 +04:00
|
|
|
|
} mca_btl_openib_device_t;
|
|
|
|
|
OBJ_CLASS_DECLARATION(mca_btl_openib_device_t);
|
2007-04-27 01:03:38 +04:00
|
|
|
|
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
struct mca_btl_openib_module_pp_qp_t {
|
|
|
|
|
int32_t dummy;
|
|
|
|
|
}; typedef struct mca_btl_openib_module_pp_qp_t mca_btl_openib_module_pp_qp_t;
|
|
|
|
|
|
|
|
|
|
struct mca_btl_openib_module_srq_qp_t {
|
2008-01-21 15:11:18 +03:00
|
|
|
|
struct ibv_srq *srq;
|
|
|
|
|
int32_t rd_posted;
|
|
|
|
|
int32_t sd_credits; /* the max number of outstanding sends on a QP when using SRQ */
|
|
|
|
|
/* i.e. the number of frags that can be outstanding (down counter) */
|
2007-11-28 10:12:44 +03:00
|
|
|
|
opal_list_t pending_frags[2]; /**< list of high/low prio frags */
|
2009-12-15 18:52:10 +03:00
|
|
|
|
/** The number of receive buffers that can be post in the current time.
|
|
|
|
|
The value may be increased in the IBV_EVENT_SRQ_LIMIT_REACHED
|
|
|
|
|
event handler. The value starts from (rd_num / 4) and increased up to rd_num */
|
|
|
|
|
int32_t rd_curr_num;
|
|
|
|
|
/** We post additional WQEs only if a number of WQEs (in specific SRQ) is less of this value.
|
|
|
|
|
The value increased together with rd_curr_num. The value is unique for every SRQ. */
|
|
|
|
|
int32_t rd_low_local;
|
|
|
|
|
/** The flag points if we want to get the
|
|
|
|
|
IBV_EVENT_SRQ_LIMIT_REACHED events for dynamically resizing SRQ */
|
|
|
|
|
bool srq_limit_event_flag;
|
2009-12-16 13:23:58 +03:00
|
|
|
|
/**< In difference of the "--mca enable_srq_resize" parameter that says, if we want(or no)
|
|
|
|
|
to start with small num of pre-posted receive buffers (rd_curr_num) and to increase this number by needs
|
|
|
|
|
(the max of this value is rd_num <EFBFBD> the whole size of SRQ), the "srq_limit_event_flag" says if we want to get limit event
|
|
|
|
|
from device if the defined srq limit was reached (signal to the main thread) and we put off this flag if the rd_curr_num
|
|
|
|
|
was increased up to rd_num.
|
|
|
|
|
In order to prevent lock/unlock operation in the critical path we prefer only put-on
|
|
|
|
|
the srq_limit_event_flag in asynchronous thread, because in this way we post receive buffers
|
|
|
|
|
in the main thread only and only after posting we set (if srq_limit_event_flag is true)
|
|
|
|
|
the limit for IBV_EVENT_SRQ_LIMIT_REACHED event. */
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
}; typedef struct mca_btl_openib_module_srq_qp_t mca_btl_openib_module_srq_qp_t;
|
|
|
|
|
|
|
|
|
|
struct mca_btl_openib_module_qp_t {
|
|
|
|
|
union {
|
|
|
|
|
mca_btl_openib_module_pp_qp_t pp_qp;
|
|
|
|
|
mca_btl_openib_module_srq_qp_t srq_qp;
|
|
|
|
|
} u;
|
|
|
|
|
}; typedef struct mca_btl_openib_module_qp_t mca_btl_openib_module_qp_t;
|
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/**
|
2007-04-27 01:03:38 +04:00
|
|
|
|
* IB BTL Interface
|
2005-07-01 01:28:35 +04:00
|
|
|
|
*/
|
|
|
|
|
struct mca_btl_openib_module_t {
|
2008-05-02 15:52:33 +04:00
|
|
|
|
/* Base BTL module */
|
|
|
|
|
mca_btl_base_module_t super;
|
|
|
|
|
|
2008-01-21 15:11:18 +03:00
|
|
|
|
bool btl_inited;
|
2008-05-02 15:52:33 +04:00
|
|
|
|
|
|
|
|
|
/** Common information about all ports */
|
|
|
|
|
mca_btl_openib_modex_message_t port_info;
|
|
|
|
|
|
|
|
|
|
/** Array of CPCs on this port */
|
|
|
|
|
ompi_btl_openib_connect_base_module_t **cpcs;
|
|
|
|
|
|
|
|
|
|
/** Number of elements in the cpcs array */
|
|
|
|
|
uint8_t num_cpcs;
|
|
|
|
|
|
2008-07-23 04:28:59 +04:00
|
|
|
|
mca_btl_openib_device_t *device;
|
2008-01-21 15:11:18 +03:00
|
|
|
|
uint8_t port_num; /**< ID of the PORT */
|
2007-04-22 14:22:12 +04:00
|
|
|
|
uint16_t pkey_index;
|
2008-01-21 15:11:18 +03:00
|
|
|
|
struct ibv_port_attr ib_port_attr;
|
2006-06-28 11:23:08 +04:00
|
|
|
|
uint16_t lid; /**< lid that is actually used (for LMC) */
|
2008-02-20 16:44:05 +03:00
|
|
|
|
int apm_port; /**< Alternative port that may be used for APM */
|
2006-06-28 11:23:08 +04:00
|
|
|
|
uint8_t src_path_bits; /**< offset from base lid (for LMC) */
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
int32_t num_peers;
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
|
|
|
|
opal_mutex_t ib_lock; /**< module level lock */
|
|
|
|
|
|
2007-04-27 01:03:38 +04:00
|
|
|
|
size_t eager_rdma_frag_size; /**< length of eager frag */
|
2007-12-23 15:29:34 +03:00
|
|
|
|
volatile int32_t eager_rdma_channels; /**< number of open RDMA channels */
|
2006-08-17 00:21:38 +04:00
|
|
|
|
|
|
|
|
|
mca_btl_base_module_error_cb_fn_t error_cb; /**< error handler */
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
mca_btl_openib_module_qp_t * qps;
|
2007-04-27 01:03:38 +04:00
|
|
|
|
};
|
|
|
|
|
typedef struct mca_btl_openib_module_t mca_btl_openib_module_t;
|
2006-12-17 15:26:41 +03:00
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
extern mca_btl_openib_module_t mca_btl_openib_module;
|
|
|
|
|
|
2006-12-17 15:26:41 +03:00
|
|
|
|
struct mca_btl_openib_reg_t {
|
|
|
|
|
mca_mpool_base_registration_t base;
|
|
|
|
|
struct ibv_mr *mr;
|
|
|
|
|
};
|
|
|
|
|
typedef struct mca_btl_openib_reg_t mca_btl_openib_reg_t;
|
|
|
|
|
|
Update libevent to the 2.0 series, currently at 2.0.7rc. We will update to their final release when it becomes available. Currently known errors exist in unused portions of the libevent code. This revision passes the IBM test suite on a Linux machine and on a standalone Mac.
This is a fairly intrusive change, but outside of the moving of opal/event to opal/mca/event, the only changes involved (a) changing all calls to opal_event functions to reflect the new framework instead, and (b) ensuring that all opal_event_t objects are properly constructed since they are now true opal_objects.
Note: Shiqing has just returned from vacation and has not yet had a chance to complete the Windows integration. Thus, this commit almost certainly breaks Windows support on the trunk. However, I want this to have a chance to soak for as long as possible before I become less available a week from today (going to be at a class for 5 days, and thus will only be sparingly available) so we can find and fix any problems.
Biggest change is moving the libevent code from opal/event to a new opal/mca/event framework. This was done to make it much easier to update libevent in the future. New versions can be inserted as a new component and tested in parallel with the current version until validated, then we can remove the earlier version if we so choose. This is a statically built framework ala installdirs, so only one component will build at a time. There is no selection logic - the sole compiled component simply loads its function pointers into the opal_event struct.
I have gone thru the code base and converted all the libevent calls I could find. However, I cannot compile nor test every environment. It is therefore quite likely that errors remain in the system. Please keep an eye open for two things:
1. compile-time errors: these will be obvious as calls to the old functions (e.g., opal_evtimer_new) must be replaced by the new framework APIs (e.g., opal_event.evtimer_new)
2. run-time errors: these will likely show up as segfaults due to missing constructors on opal_event_t objects. It appears that it became a typical practice for people to "init" an opal_event_t by simply using memset to zero it out. This will no longer work - you must either OBJ_NEW or OBJ_CONSTRUCT an opal_event_t. I tried to catch these cases, but may have missed some. Believe me, you'll know when you hit it.
There is also the issue of the new libevent "no recursion" behavior. As I described on a recent email, we will have to discuss this and figure out what, if anything, we need to do.
This commit was SVN r23925.
2010-10-24 22:35:54 +04:00
|
|
|
|
#if OMPI_ENABLE_PROGRESS_THREADS == 1
|
2006-11-02 19:15:21 +03:00
|
|
|
|
extern void* mca_btl_openib_progress_thread(opal_object_t*);
|
|
|
|
|
#endif
|
2007-04-27 01:03:38 +04:00
|
|
|
|
|
2006-08-17 00:21:38 +04:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Register a callback function that is called on error..
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL module
|
|
|
|
|
* @return Status indicating if cleanup was successful
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
int mca_btl_openib_register_error_cb(
|
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
mca_btl_base_module_error_cb_fn_t cbfunc
|
|
|
|
|
);
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Cleanup any resources held by the BTL.
|
2008-01-21 15:11:18 +03:00
|
|
|
|
*
|
2005-07-01 01:28:35 +04:00
|
|
|
|
* @param btl BTL instance.
|
|
|
|
|
* @return OMPI_SUCCESS or error status on failure.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
extern int mca_btl_openib_finalize(
|
|
|
|
|
struct mca_btl_base_module_t* btl
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* PML->BTL notification of change in the process list.
|
2008-01-21 15:11:18 +03:00
|
|
|
|
*
|
2007-04-27 01:03:38 +04:00
|
|
|
|
* @param btl (IN) BTL module
|
|
|
|
|
* @param nprocs (IN) Number of processes
|
|
|
|
|
* @param procs (IN) Set of processes
|
|
|
|
|
* @param peers (OUT) Set of (optional) peer addressing info.
|
|
|
|
|
* @param reachable (IN/OUT) Set of processes that are reachable via this BTL.
|
2005-07-01 01:28:35 +04:00
|
|
|
|
* @return OMPI_SUCCESS or error status on failure.
|
2008-01-21 15:11:18 +03:00
|
|
|
|
*
|
2005-07-01 01:28:35 +04:00
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
extern int mca_btl_openib_add_procs(
|
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
size_t nprocs,
|
|
|
|
|
struct ompi_proc_t **procs,
|
|
|
|
|
struct mca_btl_base_endpoint_t** peers,
|
2009-03-04 01:25:13 +03:00
|
|
|
|
opal_bitmap_t* reachable
|
2005-07-01 01:28:35 +04:00
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* PML->BTL notification of change in the process list.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL instance
|
|
|
|
|
* @param nproc (IN) Number of processes.
|
|
|
|
|
* @param procs (IN) Set of processes.
|
|
|
|
|
* @param peers (IN) Set of peer data structures.
|
|
|
|
|
* @return Status indicating if cleanup was successful
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
extern int mca_btl_openib_del_procs(
|
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
size_t nprocs,
|
|
|
|
|
struct ompi_proc_t **procs,
|
|
|
|
|
struct mca_btl_base_endpoint_t** peers
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* PML->BTL Initiate a send of the specified size.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL instance
|
2007-04-27 01:03:38 +04:00
|
|
|
|
* @param btl_peer (IN) BTL peer addressing
|
|
|
|
|
* @param descriptor (IN) Descriptor of data to be transmitted.
|
|
|
|
|
* @param tag (IN) Tag.
|
2005-07-01 01:28:35 +04:00
|
|
|
|
*/
|
|
|
|
|
extern int mca_btl_openib_send(
|
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
struct mca_btl_base_endpoint_t* btl_peer,
|
2008-01-21 15:11:18 +03:00
|
|
|
|
struct mca_btl_base_descriptor_t* descriptor,
|
2005-07-01 01:28:35 +04:00
|
|
|
|
mca_btl_base_tag_t tag
|
|
|
|
|
);
|
|
|
|
|
|
2009-03-25 19:53:26 +03:00
|
|
|
|
/**
|
|
|
|
|
* PML->BTL Initiate a immediate send of the specified size.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL instance
|
|
|
|
|
* @param ep (IN) Endpoint
|
|
|
|
|
* @param convertor (IN) Datatypes converter
|
|
|
|
|
* @param header (IN) PML header
|
|
|
|
|
* @param header_size (IN) PML header size
|
|
|
|
|
* @param payload_size (IN) Payload size
|
|
|
|
|
* @param order (IN) Order
|
|
|
|
|
* @param flags (IN) Flags
|
|
|
|
|
* @param tag (IN) Tag
|
|
|
|
|
* @param descriptor (OUT) Messages descriptor
|
|
|
|
|
*/
|
|
|
|
|
extern int mca_btl_openib_sendi( struct mca_btl_base_module_t* btl,
|
|
|
|
|
struct mca_btl_base_endpoint_t* ep,
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
|
struct opal_convertor_t* convertor,
|
2009-03-25 19:53:26 +03:00
|
|
|
|
void* header,
|
|
|
|
|
size_t header_size,
|
|
|
|
|
size_t payload_size,
|
|
|
|
|
uint8_t order,
|
|
|
|
|
uint32_t flags,
|
|
|
|
|
mca_btl_base_tag_t tag,
|
|
|
|
|
mca_btl_base_descriptor_t** descriptor
|
|
|
|
|
);
|
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
/**
|
|
|
|
|
* PML->BTL Initiate a put of the specified size.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL instance
|
2007-04-27 01:03:38 +04:00
|
|
|
|
* @param btl_peer (IN) BTL peer addressing
|
|
|
|
|
* @param descriptor (IN) Descriptor of data to be transmitted.
|
2005-07-01 01:28:35 +04:00
|
|
|
|
*/
|
|
|
|
|
extern int mca_btl_openib_put(
|
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
struct mca_btl_base_endpoint_t* btl_peer,
|
2007-04-27 01:03:38 +04:00
|
|
|
|
struct mca_btl_base_descriptor_t* descriptor
|
2005-08-18 21:08:27 +04:00
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* PML->BTL Initiate a get of the specified size.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL instance
|
|
|
|
|
* @param btl_base_peer (IN) BTL peer addressing
|
2007-04-27 01:03:38 +04:00
|
|
|
|
* @param descriptor (IN) Descriptor of data to be transmitted.
|
2005-08-18 21:08:27 +04:00
|
|
|
|
*/
|
|
|
|
|
extern int mca_btl_openib_get(
|
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
struct mca_btl_base_endpoint_t* btl_peer,
|
2007-04-27 01:03:38 +04:00
|
|
|
|
struct mca_btl_base_descriptor_t* descriptor
|
2005-08-18 21:08:27 +04:00
|
|
|
|
);
|
2008-01-21 15:11:18 +03:00
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Allocate a descriptor.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL module
|
|
|
|
|
* @param size (IN) Requested descriptor size.
|
|
|
|
|
*/
|
|
|
|
|
extern mca_btl_base_descriptor_t* mca_btl_openib_alloc(
|
2007-12-09 17:00:42 +03:00
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
struct mca_btl_base_endpoint_t* endpoint,
|
|
|
|
|
uint8_t order,
|
2007-12-09 17:08:01 +03:00
|
|
|
|
size_t size,
|
2008-01-21 15:11:18 +03:00
|
|
|
|
uint32_t flags);
|
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Return a segment allocated by this BTL.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL module
|
|
|
|
|
* @param descriptor (IN) Allocated descriptor.
|
|
|
|
|
*/
|
|
|
|
|
extern int mca_btl_openib_free(
|
2008-01-21 15:11:18 +03:00
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
mca_btl_base_descriptor_t* des);
|
|
|
|
|
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Pack data and return a descriptor that can be
|
|
|
|
|
* used for send/put.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL module
|
|
|
|
|
* @param peer (IN) BTL peer addressing
|
|
|
|
|
*/
|
|
|
|
|
mca_btl_base_descriptor_t* mca_btl_openib_prepare_src(
|
2005-07-12 17:38:54 +04:00
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
|
struct mca_btl_base_endpoint_t* peer,
|
2008-01-21 15:11:18 +03:00
|
|
|
|
mca_mpool_base_registration_t* registration,
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
|
struct opal_convertor_t* convertor,
|
2007-05-24 23:51:26 +04:00
|
|
|
|
uint8_t order,
|
2005-07-12 17:38:54 +04:00
|
|
|
|
size_t reserve,
|
2007-12-09 17:08:01 +03:00
|
|
|
|
size_t* size,
|
|
|
|
|
uint32_t flags
|
2005-07-12 17:38:54 +04:00
|
|
|
|
);
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Allocate a descriptor initialized for RDMA write.
|
|
|
|
|
*
|
|
|
|
|
* @param btl (IN) BTL module
|
|
|
|
|
* @param peer (IN) BTL peer addressing
|
|
|
|
|
*/
|
2008-01-21 15:11:18 +03:00
|
|
|
|
extern mca_btl_base_descriptor_t* mca_btl_openib_prepare_dst(
|
|
|
|
|
struct mca_btl_base_module_t* btl,
|
2005-07-12 17:38:54 +04:00
|
|
|
|
struct mca_btl_base_endpoint_t* peer,
|
2008-01-21 15:11:18 +03:00
|
|
|
|
mca_mpool_base_registration_t* registration,
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
|
struct opal_convertor_t* convertor,
|
2007-05-24 23:51:26 +04:00
|
|
|
|
uint8_t order,
|
2005-07-12 17:38:54 +04:00
|
|
|
|
size_t reserve,
|
2007-12-09 17:08:01 +03:00
|
|
|
|
size_t* size,
|
2008-01-21 15:11:18 +03:00
|
|
|
|
uint32_t flags);
|
2005-07-01 01:28:35 +04:00
|
|
|
|
|
2007-11-28 10:16:52 +03:00
|
|
|
|
extern void mca_btl_openib_frag_progress_pending_put_get(
|
|
|
|
|
struct mca_btl_base_endpoint_t*, const int);
|
|
|
|
|
|
2007-03-17 02:11:45 +03:00
|
|
|
|
/**
|
|
|
|
|
* Fault Tolerance Event Notification Function
|
2007-04-27 01:03:38 +04:00
|
|
|
|
*
|
|
|
|
|
* @param state (IN) Checkpoint State
|
2007-03-17 02:11:45 +03:00
|
|
|
|
* @return OMPI_SUCCESS or failure status
|
|
|
|
|
*/
|
2007-04-27 01:03:38 +04:00
|
|
|
|
extern int mca_btl_openib_ft_event(int state);
|
|
|
|
|
|
2007-03-17 02:11:45 +03:00
|
|
|
|
|
2009-06-18 16:24:39 +04:00
|
|
|
|
/**
|
|
|
|
|
* Show an error during init, particularly when running out of
|
|
|
|
|
* registered memory.
|
|
|
|
|
*/
|
|
|
|
|
void mca_btl_openib_show_init_error(const char *file, int line,
|
|
|
|
|
const char *func, const char *dev);
|
|
|
|
|
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
#define BTL_OPENIB_HP_CQ 0
|
|
|
|
|
#define BTL_OPENIB_LP_CQ 1
|
|
|
|
|
|
2006-09-05 20:00:18 +04:00
|
|
|
|
|
2007-04-27 01:03:38 +04:00
|
|
|
|
/**
|
2008-01-21 15:11:18 +03:00
|
|
|
|
* Post to Shared Receive Queue with certain priority
|
2007-04-27 01:03:38 +04:00
|
|
|
|
*
|
|
|
|
|
* @param openib_btl (IN) BTL module
|
|
|
|
|
* @param additional (IN) Additional Bytes to reserve
|
|
|
|
|
* @param prio (IN) Priority (either BTL_OPENIB_HP_QP or BTL_OPENIB_LP_QP)
|
|
|
|
|
* @return OMPI_SUCCESS or failure status
|
|
|
|
|
*/
|
|
|
|
|
|
2007-11-28 17:52:31 +03:00
|
|
|
|
int mca_btl_openib_post_srr(mca_btl_openib_module_t* openib_btl, const int qp);
|
2006-09-07 17:05:41 +04:00
|
|
|
|
|
2009-12-15 17:25:07 +03:00
|
|
|
|
/**
|
|
|
|
|
* Get a transport name of btl by its transport type.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
const char* btl_openib_get_transport_name(mca_btl_openib_transport_type_t transport_type);
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Get a transport type of btl.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
mca_btl_openib_transport_type_t mca_btl_openib_get_transport_type(mca_btl_openib_module_t* openib_btl);
|
|
|
|
|
|
2007-11-28 10:20:26 +03:00
|
|
|
|
static inline int qp_cq_prio(const int qp)
|
2007-11-28 10:18:59 +03:00
|
|
|
|
{
|
2007-11-28 10:20:26 +03:00
|
|
|
|
if(0 == qp)
|
|
|
|
|
return BTL_OPENIB_HP_CQ; /* smallest qp is always HP */
|
|
|
|
|
|
|
|
|
|
/* If the size for this qp is <= the eager limit, make it a
|
|
|
|
|
high priority QP. Otherwise, make it a low priority QP. */
|
|
|
|
|
return (mca_btl_openib_component.qp_infos[qp].size <=
|
|
|
|
|
mca_btl_openib_component.eager_limit) ?
|
|
|
|
|
BTL_OPENIB_HP_CQ : BTL_OPENIB_LP_CQ;
|
2007-11-28 10:18:59 +03:00
|
|
|
|
}
|
|
|
|
|
|
This commit brings in two major things:
1. Galen's fine-grain control of queue pair resources in the openib
BTL.
1. Pasha's new implementation of asychronous HCA event handling.
Pasha's new implementation doesn't take much explanation, but the new
"multifrag" stuff does.
Note that "svn merge" was not used to bring this new code from the
/tmp/ib_multifrag branch -- something Bad happened in the periodic
trunk pulls on that branch making an actual merge back to the trunk
effectively impossible (i.e., lots and lots of arbitrary conflicts and
artifical changes). :-(
== Fine-grain control of queue pair resources ==
Galen's fine-grain control of queue pair resources to the OpenIB BTL
(thanks to Gleb for fixing broken code and providing additional
functionality, Pasha for finding broken code, and Jeff for doing all
the svn work and regression testing).
Prior to this commit, the OpenIB BTL created two queue pairs: one for
eager size fragments and one for max send size fragments. When the
use of the shared receive queue (SRQ) was specified (via "-mca
btl_openib_use_srq 1"), these QPs would use a shared receive queue for
receive buffers instead of the default per-peer (PP) receive queues
and buffers. One consequence of this design is that receive buffer
utilization (the size of the data received as a percentage of the
receive buffer used for the data) was quite poor for a number of
applications.
The new design allows multiple QPs to be specified at runtime. Each
QP can be setup to use PP or SRQ receive buffers as well as giving
fine-grained control over receive buffer size, number of receive
buffers to post, when to replenish the receive queue (low water mark)
and for SRQ QPs, the number of outstanding sends can also be
specified. The following is an example of the syntax to describe QPs
to the OpenIB BTL using the new MCA parameter btl_openib_receive_queues:
{{{
-mca btl_openib_receive_queues \
"P,128,16,4;S,1024,256,128,32;S,4096,256,128,32;S,65536,256,128,32"
}}}
Each QP description is delimited by ";" (semicolon) with individual
fields of the QP description delimited by "," (comma). The above
example therefore describes 4 QPs.
The first QP is:
P,128,16,4
Meaning: per-peer receive buffer QPs are indicated by a starting field
of "P"; the first QP (shown above) is therefore a per-peer based QP.
The second field indicates the size of the receive buffer in bytes
(128 bytes). The third field indicates the number of receive buffers
to allocate to the QP (16). The fourth field indicates the low
watermark for receive buffers at which time the BTL will repost
receive buffers to the QP (4).
The second QP is:
S,1024,256,128,32
Shared receive queue based QPs are indicated by a starting field of
"S"; the second QP (shown above) is therefore a shared receive queue
based QP. The second, third and fourth fields are the same as in the
per-peer based QP. The fifth field is the number of outstanding sends
that are allowed at a given time on the QP (32). This provides a
"good enough" mechanism of flow control for some regular communication
patterns.
QPs MUST be specified in ascending receive buffer size order. This
requirement may be removed prior to 1.3 release.
This commit was SVN r15474.
2007-07-18 05:15:59 +04:00
|
|
|
|
#define BTL_OPENIB_RDMA_QP(QP) \
|
|
|
|
|
((QP) == mca_btl_openib_component.rdma_qp)
|
|
|
|
|
|
2007-06-14 05:59:25 +04:00
|
|
|
|
END_C_DECLS
|
|
|
|
|
|
2007-04-27 01:03:38 +04:00
|
|
|
|
#endif /* MCA_BTL_IB_H */
|