This is the binary tree topology used by MALP for its internal communications.
More...
This is the binary tree topology used by MALP for its internal communications.
This is used to build a mpi process topology for communication. It is basically used in the reduction process (see Red_Ht) Each mpi process creates a Binary_Tree with their rank (given by MPI_Comm_rank) and run size (given by MPI_Comm_size). For a given size and rank, parent and children can be found with initializing a Binary_Tree with Binary_Tree_init.
static int Binary_Tree_child_count |
( |
struct Binary_Tree * |
bt | ) |
|
|
inlinestatic |
void Binary_Tree_init |
( |
struct Binary_Tree * |
bt, |
|
|
int |
rank, |
|
|
int |
size |
|
) |
| |
Initialization of a binary tree.
- Parameters
-
bt | the tree to initialize |
rank | the rank of initialized tree |
size | the size of the tree |
Definition at line 22 of file Binary_Tree.c.
static int Binary_Tree_left_child |
( |
struct Binary_Tree * |
bt | ) |
|
|
inlinestatic |
static int Binary_Tree_parent |
( |
struct Binary_Tree * |
bt | ) |
|
|
inlinestatic |
releases a binary tree
- Parameters
-
bt | the binary tree to release |
Definition at line 67 of file Binary_Tree.c.
static int Binary_Tree_right_child |
( |
struct Binary_Tree * |
bt | ) |
|
|
inlinestatic |