#include <treeStrategy_nodeAware_minBytes.h>
Public Member Functions | |
virtual SpanningTreeVertex * | buildNextGen (const Iterator firstVtx, const Iterator beyondLastVtx, const int maxBranches=2) |
Concrete builders should implement this (preferably only for the appropriate specializations). |
Minimizes the total bytes on the network by constructing separate sub-tree(s) for same-node PEs. Uses the cpuTopology API defined in charm. Hence, should be node-aware in all environments.
Note that this node awareness has nothing to do with charm smp builds. Rather, its about minimizing the number of messages that arrive or leave a single physical machine node for a multicast / reduction.
Definition at line 25 of file treeStrategy_nodeAware_minBytes.h.
virtual SpanningTreeVertex* topo::SpanningTreeStrategy_nodeAware_minBytes< Iterator, ValueType >::buildNextGen | ( | const Iterator | firstVtx, | |
const Iterator | beyondLastVtx, | |||
const int | maxBranches = 2 | |||
) | [inline, virtual] |
Concrete builders should implement this (preferably only for the appropriate specializations).
Implements topo::SpanningTreeStrategy< Iterator >.
Definition at line 28 of file treeStrategy_nodeAware_minBytes.h.
References topo::impl::buildNextGen_nodeAware_minBytes().