stapl::paragraph_impl::tree_info Struct Reference

Represents the statistics of a balanced binary tree of tasks that is part of a PARAGRAPH performing a reduction or prefix scan on a view. More...

Public Attributes
int	width
	The width of the tree.
int	height
	The height of the tree.
int	leaf_offset
	The number of view elements to the left of the first view element processed by this tree.
int	id_offset
	The id of the task that will process the leftmost leaf of the tree.
int	root_task_id
	The id of the root task in the tree.
int	curr_id
	The current task id for the tree. Needed because the map_reduce_factory and prefix_scan_factory generate tasks of the task graph beginning at the leaves of the reduction tree and generating one level at a time, which requires traversing the entire set of trees for each level of tasks.
int	elements_remaining
	The number of view elements that are processed by smaller trees to the right of the current tree.

Detailed Description

Represents the statistics of a balanced binary tree of tasks that is part of a PARAGRAPH performing a reduction or prefix scan on a view.

---

The documentation for this struct was generated from the following file:

• tree_info.h