milupHPC documentation
Tree Class Reference
Collaboration diagram for Tree:
Public Attributes | |
| integer * | count |
| accumulated nodes/leaves beneath More... | |
| integer * | start |
| TODO: describe start. More... | |
| integer * | child |
| children/child nodes or leaves (beneath) More... | |
| integer * | sorted |
| sorted (indices) for better cache performance More... | |
| integer * | index |
| index used for counting nodes More... | |
| integer * | toDeleteLeaf |
| buffer for remembering old indices for rebuilding tree More... | |
| integer * | toDeleteNode |
| buffer for remembering old indices for rebuilding tree More... | |
| real * | minX |
| bounding box minimal x More... | |
| real * | maxX |
| bounding box maximal x More... | |
| real * | minY |
| bounding box minimal y More... | |
| real * | maxY |
| bounding box maximal y More... | |
| real * | minZ |
| bounding box minimal z More... | |
| real * | maxZ |
| bounding box maximal z More... | |
Detailed Description
Tree class.
Class to build and store hierarchical tree structure.
Since dynamic memory allocation and access to heap objects in GPUs are usually suboptimal, an array-based data structure is used to store the (pseudo-)particle information as well as the tree and allows for efficient cache alignment. Consequently, array indices are used instead of pointers to constitute the tree out of the tree nodes, whereas "-1" represents a null pointer and "-2" is used for locking nodes. For this purpose an array with the minimum length \( 2^{d} \cdot (M - N) \) with dimensionality \( d \) and number of cells \( (M -N) \) is needed to store the children. The \( i \)-th child of node \( c \) can therefore be accessed via index \( 2^d \cdot c + i \).
Constructor & Destructor Documentation
◆ Tree() [1/4]
| CUDA_CALLABLE_MEMBER Tree::Tree | ( | ) |
◆ Tree() [2/4]
| CUDA_CALLABLE_MEMBER Tree::Tree | ( | integer * | count, |
| integer * | start, | ||
| integer * | child, | ||
| integer * | sorted, | ||
| integer * | index, | ||
| integer * | toDeleteLeaf, | ||
| integer * | toDeleteNode, | ||
| real * | minX, | ||
| real * | maxX | ||
| ) |
Constructor, passing pointer to member variables.
- Parameters
-
count allocated array for accumulated nodes/leaves beneath start allocated array for child allocated array for children sorted allocated array for sorted (indices) for better cache performance index allocated value for index used for counting nodes toDeleteLeaf allocated array for remembering old indices for rebuilding tree toDeleteNode allocated array for remembering old indices for rebuilding tree minX allocated value for bounding box minimal x maxX allocated value for bounding box maximal x
◆ Tree() [3/4]
| CUDA_CALLABLE_MEMBER Tree::Tree | ( | integer * | count, |
| integer * | start, | ||
| integer * | child, | ||
| integer * | sorted, | ||
| integer * | index, | ||
| integer * | toDeleteLeaf, | ||
| integer * | toDeleteNode, | ||
| real * | minX, | ||
| real * | maxX, | ||
| real * | minY, | ||
| real * | maxY | ||
| ) |
Constructor, passing pointer to member variables.
- Parameters
-
count allocated array for accumulated nodes/leaves beneath start allocated array for child allocated array for children sorted allocated array for sorted (indices) for better cache performance index allocated value for index used for counting nodes toDeleteLeaf allocated array for remembering old indices for rebuilding tree toDeleteNode allocated array for remembering old indices for rebuilding tree minX allocated value for bounding box minimal x maxX allocated value for bounding box maximal x minY allocated value for bounding box minimal y maxY allocated value for bounding box maximal y
◆ Tree() [4/4]
| CUDA_CALLABLE_MEMBER Tree::Tree | ( | integer * | count, |
| integer * | start, | ||
| integer * | child, | ||
| integer * | sorted, | ||
| integer * | index, | ||
| integer * | toDeleteLeaf, | ||
| integer * | toDeleteNode, | ||
| real * | minX, | ||
| real * | maxX, | ||
| real * | minY, | ||
| real * | maxY, | ||
| real * | minZ, | ||
| real * | maxZ | ||
| ) |
Constructor, passing pointer to member variables.
- Parameters
-
count allocated array for accumulated nodes/leaves beneath start allocated array for child allocated array for children sorted allocated array for sorted (indices) for better cache performance index allocated value for index used for counting nodes toDeleteLeaf allocated array for remembering old indices for rebuilding tree toDeleteNode allocated array for remembering old indices for rebuilding tree minX allocated value for bounding box minimal x maxX allocated value for bounding box maximal x minY allocated value for bounding box minimal y maxY allocated value for bounding box maximal y minZ allocated value for bounding box minimal z maxZ allocated value for bounding box maximal z
◆ ~Tree()
| CUDA_CALLABLE_MEMBER Tree::~Tree | ( | ) |
Member Function Documentation
◆ getParticleKey()
| CUDA_CALLABLE_MEMBER keyType Tree::getParticleKey | ( | Particles * | particles, |
| integer | index, | ||
| integer | maxLevel, | ||
| Curve::Type | curveType = Curve::lebesgue |
||
| ) |
Get SFC key of a particle.
The particle key computation can be accomplished by using the particle's location within the simulation domain, thus regarding the bounding boxes, which is equivalent to a tree traversing.
The Lebesgue keys can be converted via tables.
- Parameters
-
particles instance of particles (array) index desired index in particles to get tree of desired particle maxLevel max tree level curveType space-filling curve type to be assumed (Lebesgue/Hilbert)
- Returns
- particle key
Definition at line 157 of file tree.cu.
Here is the call graph for this function:
◆ getTreeLevel()
| CUDA_CALLABLE_MEMBER integer Tree::getTreeLevel | ( | Particles * | particles, |
| integer | index, | ||
| integer | maxLevel, | ||
| Curve::Type | curveType = Curve::lebesgue |
||
| ) |
Get tree level for a (specific) particle.
Calculates the particle key and uses key to construct path within tree, returning when path lead to the desired particle/index of the particle.
- Parameters
-
particles particles instance of particles (array) index desired index in particles to get tree of desired particle maxLevel max tree level curveType space-filling curve type to be assumed (Lebesgue/Hilbert)
- Returns
- particles[index] tree level
Definition at line 242 of file tree.cu.
Here is the call graph for this function:
◆ reset()
| CUDA_CALLABLE_MEMBER void Tree::reset | ( | integer | index, |
| integer | n | ||
| ) |
◆ set() [1/3]
| CUDA_CALLABLE_MEMBER void Tree::set | ( | integer * | count, |
| integer * | start, | ||
| integer * | child, | ||
| integer * | sorted, | ||
| integer * | index, | ||
| integer * | toDeleteLeaf, | ||
| integer * | toDeleteNode, | ||
| real * | minX, | ||
| real * | maxX | ||
| ) |
Setter, passing pointer to member variables.
- Parameters
-
count allocated array for accumulated nodes/leaves beneath start allocated array for child allocated array for children sorted allocated array for sorted (indices) for better cache performance index allocated value for index used for counting nodes toDeleteLeaf allocated array for remembering old indices for rebuilding tree toDeleteNode allocated array for remembering old indices for rebuilding tree minX allocated value for bounding box minimal x maxX allocated value for bounding box maximal x
◆ set() [2/3]
| CUDA_CALLABLE_MEMBER void Tree::set | ( | integer * | count, |
| integer * | start, | ||
| integer * | child, | ||
| integer * | sorted, | ||
| integer * | index, | ||
| integer * | toDeleteLeaf, | ||
| integer * | toDeleteNode, | ||
| real * | minX, | ||
| real * | maxX, | ||
| real * | minY, | ||
| real * | maxY | ||
| ) |
Setter, passing pointer to member variables.
- Parameters
-
count allocated array for accumulated nodes/leaves beneath start allocated array for child allocated array for children sorted allocated array for sorted (indices) for better cache performance index allocated value for index used for counting nodes toDeleteLeaf allocated array for remembering old indices for rebuilding tree toDeleteNode allocated array for remembering old indices for rebuilding tree minX allocated value for bounding box minimal x maxX allocated value for bounding box maximal x minY allocated value for bounding box minimal y maxY allocated value for bounding box maximal y
◆ set() [3/3]
| CUDA_CALLABLE_MEMBER void Tree::set | ( | integer * | count, |
| integer * | start, | ||
| integer * | child, | ||
| integer * | sorted, | ||
| integer * | index, | ||
| integer * | toDeleteLeaf, | ||
| integer * | toDeleteNode, | ||
| real * | minX, | ||
| real * | maxX, | ||
| real * | minY, | ||
| real * | maxY, | ||
| real * | minZ, | ||
| real * | maxZ | ||
| ) |
Constructor, passing pointer to member variables.
- Parameters
-
count allocated array for accumulated nodes/leaves beneath start allocated array for child allocated array for children sorted allocated array for sorted (indices) for better cache performance index allocated value for index used for counting nodes toDeleteLeaf allocated array for remembering old indices for rebuilding tree toDeleteNode allocated array for remembering old indices for rebuilding tree minX allocated value for bounding box minimal x maxX allocated value for bounding box maximal x minY allocated value for bounding box minimal y maxY allocated value for bounding box maximal y minZ allocated value for bounding box minimal z maxZ allocated value for bounding box maximal z
◆ sumParticles()
| CUDA_CALLABLE_MEMBER integer Tree::sumParticles | ( | ) |
Member Data Documentation
◆ child
| integer* Tree::child |
◆ count
| integer* Tree::count |
◆ index
◆ maxX
◆ maxY
◆ maxZ
◆ minX
◆ minY
◆ minZ
◆ sorted
| integer* Tree::sorted |
◆ start
◆ toDeleteLeaf
| integer* Tree::toDeleteLeaf |
◆ toDeleteNode
| integer* Tree::toDeleteNode |
The documentation for this class was generated from the following files:
milupHPC - Tree Class Reference
Generated on Wed Aug 31 2022 12:16:53 by Doxygen 1.9.3