#include <treeStrategy_3dTorus_minBytesHops.h>
Public Member Functions | |
virtual SpanningTreeVertex * | buildNextGen (const Iterator firstVtx, const Iterator beyondLastVtx, const int maxBranches=2)=0 |
Concrete builders should implement this (preferably only for the appropriate specializations). |
Naturally, can also work with 3D meshes (portions of the torus).
Reduces the total number of bytes that reach the network (ie reduces inter-node traffic) by building separate sub-trees to span intra-node PEs, and then reduces the total number of hops across the whole tree. Hence, should be more effictive than the strategy that reduces hops alone, but possibly at the expense of perfect balance in the spanning tree.
Specialized and implemented only for data type in input container = vtxType / SpanningTreeVertex.
Definition at line 26 of file treeStrategy_3dTorus_minBytesHops.h.
virtual SpanningTreeVertex* topo::SpanningTreeStrategy_3dTorus_minBytesHops< Iterator, ValueType >::buildNextGen | ( | const Iterator | firstVtx, | |
const Iterator | beyondLastVtx, | |||
const int | maxBranches = 2 | |||
) | [pure virtual] |
Concrete builders should implement this (preferably only for the appropriate specializations).
Implements topo::SpanningTreeStrategy< Iterator >.
Referenced by topo::topo::SpanningTreeStrategy_3dTorus_minBytesHops< Iterator, vtxType >::buildNextGen().