|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Node ranking as augmented by the algorithm chassis.
Presumably a node ordering policy first needs to compute an initial ordering of nodes. In order to do this as easily as possible, the node ordering policy needs to know the number of ranks and the number of nodes in each rank, so that the node ordering policy can directly allocate a properly shaped area of storage for storing the ordering, if necessary.
Method Summary | |
int[] |
rankToNumNodesTable()
rankToNumNodesTable()[rankIdx] is the number of nodes
in rank rankIdx . |
Methods inherited from interface suvi.alg.interfaces.NodeRanking |
rankOf |
Method Detail |
public int[] rankToNumNodesTable()
rankToNumNodesTable()[rankIdx]
is the number of nodes
in rank rankIdx
. Modifying the returned array has
undefined consequences.
Rationale: This way of representing the number of nodes in each rank makes it very easy to define a [re]usable method that creates a properly shaped area of storage for storing the ordering.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |