Package | Description |
---|---|
edu.isi.pegasus.planner.partitioner |
Modifier and Type | Class and Description |
---|---|
class |
ClustererCallback
A Callback implementation that passes the partitions detected during the
partitioning of the worflow to a Clusterer for clustering.
|
class |
WriterCallback
This callback writes out a
DAX file for each of the partitions,
and also writes out a PDAX file that captures the relations
between the partitions. |
Modifier and Type | Method and Description |
---|---|
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.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.constructPartitions(Callback c,
java.util.List nodes,
int level)
Given a list of jobs, constructs (one or more) partitions out of it.
|
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,
java.lang.String name)
Given a list of jobs, constructs (one or more) partitions out of it.
|
void |
One2One.determinePartitions(Callback c)
This ends up writing out a partition for each job in the dax.
|
void |
BFS.determinePartitions(Callback c)
Does a constrained breadth first search to identify the partitions, and
calls out to write out the partition graph.
|
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 |
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 |
Whole.determinePartitions(Callback c)
This ends up writing out a partition for each job in the dax.
|
protected void |
Horizontal.done(Callback c)
Indicates that we are done with the traversal of the graph.
|
protected void |
BFS.done(Callback c)
Indicates that we are done with the partitioning.
|