1
1
This commit was SVN r11703.
Этот коммит содержится в:
Rainer Keller 2006-09-19 07:55:41 +00:00
родитель b49ff3a3b7
Коммит 80166a9516
3 изменённых файлов: 26 добавлений и 26 удалений

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

@ -40,27 +40,27 @@
* a layer of abstraction over multiple physical devices (e.g. NICs), * a layer of abstraction over multiple physical devices (e.g. NICs),
* (3) a list containing multiple BTL modules where each BTL module * (3) a list containing multiple BTL modules where each BTL module
* corresponds to a single physical device. * corresponds to a single physical device.
* *
* During module initialization, the module should post any addressing * During module initialization, the module should post any addressing
* information required by its peers. An example would be the TCP * information required by its peers. An example would be the TCP
* listen port opened by the TCP module for incoming connection * listen port opened by the TCP module for incoming connection
* requests. This information is published to peers via the * requests. This information is published to peers via the
* mca_pml_base_modex_send() interface. Note that peer information is not * mca_pml_base_modex_send() interface. Note that peer information is not
* guaranteed to be available via mca_pml_base_modex_recv() during the * guaranteed to be available via mca_pml_base_modex_recv() during the
* module's init function. However, it will be available during * module's init function. However, it will be available during
* BTL selection (mca_btl_base_add_proc_fn_t()). * BTL selection (mca_btl_base_add_proc_fn_t()).
* *
* BTL Selection: * BTL Selection:
* *
* The upper layer builds an ordered list of the available BTL modules sorted * The upper layer builds an ordered list of the available BTL modules sorted
* by their exclusivity ranking. This is a relative ranking that is used * by their exclusivity ranking. This is a relative ranking that is used
* to determine the set of BTLs that may be used to reach a given destination. * to determine the set of BTLs that may be used to reach a given destination.
* During startup the BTL modules are queried via their * During startup the BTL modules are queried via their
* mca_btl_base_add_proc_fn_t() to determine if they are able to reach * mca_btl_base_add_proc_fn_t() to determine if they are able to reach
* a given destination. The BTL module with the highest ranking that * a given destination. The BTL module with the highest ranking that
* returns success is selected. Subsequent BTL modules are selected only * returns success is selected. Subsequent BTL modules are selected only
* if they have the same exclusivity ranking. * if they have the same exclusivity ranking.
* *
* An example of how this might be used: * An example of how this might be used:
* *
* BTL Exclusivity Comments * BTL Exclusivity Comments
@ -73,36 +73,36 @@
* TCP 0 Selected based on network reachability * TCP 0 Selected based on network reachability
* *
* When a BTL module is selected, it may choose to optionally return a * When a BTL module is selected, it may choose to optionally return a
* pointer to an an mca_btl_base_endpoint_t data structure to the PML. * pointer to an an mca_btl_base_endpoint_t data structure to the PML.
* This pointer is treated as an opaque handle by the PML and is * This pointer is treated as an opaque handle by the PML and is
* returned to the BTL on subsequent data transfer calls to the * returned to the BTL on subsequent data transfer calls to the
* corresponding destination process. The actual contents of the * corresponding destination process. The actual contents of the
* data structure are defined on a per BTL basis, and may be used to * data structure are defined on a per BTL basis, and may be used to
* cache addressing or connection information, such as a TCP socket * cache addressing or connection information, such as a TCP socket
* or IB queue pair. * or IB queue pair.
* *
* Progress: * Progress:
* *
* By default, the library provides for polling based progress of outstanding * By default, the library provides for polling based progress of outstanding
* requests. The BTL component exports an interface function (btlm_progress) * requests. The BTL component exports an interface function (btl_progress)
* that is called in a polling mode by the PML during calls into the MPI * that is called in a polling mode by the PML during calls into the MPI
* library. Note that the btlm_progress() function is called on the BTL component * library. Note that the btlm_progress() function is called on the BTL component
* rather than each BTL module. This implies that the BTL author is responsible * rather than each BTL module. This implies that the BTL author is responsible
* for iterating over the pending operations in each of the BTL modules associated * for iterating over the pending operations in each of the BTL modules associated
* with the component. * with the component.
* *
* On platforms where threading support is provided, the library provides the * On platforms where threading support is provided, the library provides the
* option of building with asynchronous threaded progress. In this case, the BTL * option of building with asynchronous threaded progress. In this case, the BTL
* author is responsible for providing a thread to progress pending operations. * author is responsible for providing a thread to progress pending operations.
* A thread is associated with the BTL component/module such that transport specific * A thread is associated with the BTL component/module such that transport specific
* functionality/APIs may be used to block the thread ubtll a pending operation * functionality/APIs may be used to block the thread until a pending operation
* completes. This thread MUST NOT poll for completion as this would oversubscribe * completes. This thread MUST NOT poll for completion as this would oversubscribe
* the CPU. * the CPU.
* *
* Note that in the threaded case the PML may choose to use a hybrid approach, * Note that in the threaded case the PML may choose to use a hybrid approach,
* such that polling is implemented from the user thread for a fixed number of * such that polling is implemented from the user thread for a fixed number of
* cycles before relying on the background thread(s) to complete requests. If * cycles before relying on the background thread(s) to complete requests. If
* possible the BTL should support the use of both modes concurrebtly. * possible the BTL should support the use of both modes concurrently.
* *
*/ */

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

@ -140,7 +140,7 @@ int mca_btl_mvapi_component_open(void)
mca_btl_mvapi_param_register_int ("max_btls", "maximum number of HCAs/ports to use", mca_btl_mvapi_param_register_int ("max_btls", "maximum number of HCAs/ports to use",
4, &tmp_int); 4, &tmp_int);
mca_btl_mvapi_component.ib_max_btls = tmp_int; mca_btl_mvapi_component.ib_max_btls = tmp_int;
mca_btl_mvapi_param_register_int ("free_list_num", "intial size of free lists", mca_btl_mvapi_param_register_int ("free_list_num", "initial size of free lists",
8, &mca_btl_mvapi_component.ib_free_list_num); 8, &mca_btl_mvapi_component.ib_free_list_num);
mca_btl_mvapi_param_register_int ("free_list_max", "maximum size of free lists", mca_btl_mvapi_param_register_int ("free_list_max", "maximum size of free lists",
-1, &mca_btl_mvapi_component.ib_free_list_max); -1, &mca_btl_mvapi_component.ib_free_list_max);

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

@ -101,7 +101,7 @@ bool ompi_mpi_maffinity_setup = false;
* corresponding dummy function that is invoked from this function). * corresponding dummy function that is invoked from this function).
* *
* Additionally, there can be/are strange linking paths such that * Additionally, there can be/are strange linking paths such that
* ompi_info needs symbols symbols such as ompi_fortran_status_ignore, * ompi_info needs symbols such as ompi_fortran_status_ignore,
* which, if they weren't here with a collection of other global * which, if they weren't here with a collection of other global
* symbols that are initialized (which seems to force this .o file to * symbols that are initialized (which seems to force this .o file to
* be pulled into the resolution process, because ompi_info certainly * be pulled into the resolution process, because ompi_info certainly