Network structure for recursive halving algorithm.
More...
#include <network.h>
|
int | k |
| Communication times for one recursize halving algorithm
|
|
RecursiveHalvingNodeType | type |
| Node type.
|
|
bool | is_power_of_2 |
|
int | neighbor |
|
std::vector< int > | ranks |
| ranks[i] means the machines that will communicate with on i-th communication
|
|
std::vector< int > | send_block_start |
| send_block_start[i] means send block start index at i-th communication
|
|
std::vector< int > | send_block_len |
| send_block_start[i] means send block size at i-th communication
|
|
std::vector< int > | recv_block_start |
| send_block_start[i] means recv block start index at i-th communication
|
|
std::vector< int > | recv_block_len |
| send_block_start[i] means recv block size at i-th communication
|
|
Network structure for recursive halving algorithm.
◆ Construct()
Create the object of recursive halving map.
- Parameters
-
rank | Rank of this machine |
num_machines | The total number of machines |
- Returns
- The object of recursive halving map
The documentation for this class was generated from the following files:
- External/LightGBM_2.2.3/LightGBM-2.2.3/include/LightGBM/network.h
- External/LightGBM_2.2.3/LightGBM-2.2.3/src/network/linker_topo.cpp