protected void |
BFS.constructLevelRelations(Callback c,
int parent,
int child) |
Calls out to the callback with appropriate relations between the partitions
constructed for the levels.
|
protected void |
Horizontal.constructLevelRelations(Callback c,
int parent,
int child) |
Calls out to the callback with appropriate relations between the partitions
constructed for the levels.
|
protected void |
BFS.constructPartitions(Callback c,
java.util.List nodes,
int level) |
Given a list of jobs, constructs (one or more) partitions out of it.
|
protected void |
Horizontal.constructPartitions(Callback c,
java.util.List nodes,
int level) |
Given a list of jobs, constructs (one or more) partitions out of it.
|
protected void |
Horizontal.constructPartitions(Callback c,
java.util.List nodes,
int level,
java.lang.String name) |
Given a list of jobs, constructs (one or more) partitions out of it.
|
void |
BFS.determinePartitions(Callback c) |
Does a constrained breadth first search to identify the partitions, and
calls out to write out the partition graph.
|
void |
Label.determinePartitions(Callback c) |
Partitions the graph passed in the constructor, on the basis of the labels
associated with the nodes in the graph.
|
void |
One2One.determinePartitions(Callback c) |
This ends up writing out a partition for each job in the dax.
|
abstract void |
Partitioner.determinePartitions(Callback c) |
The main function that ends up traversing the graph structure corrsponding
to the dax and creates the smaller dax files(one dax file per partition)
and the .pdax file that illustrates the partition graph.
|
void |
Whole.determinePartitions(Callback c) |
This ends up writing out a partition for each job in the dax.
|
protected void |
BFS.done(Callback c) |
Indicates that we are done with the partitioning.
|
protected void |
Horizontal.done(Callback c) |
Indicates that we are done with the traversal of the graph.
|