public class NepheleJobGraphGenerator extends Object implements Visitor<PlanNode>
The basic method of operation is a top down traversal over the plan graph. On the way down, tasks are created for the plan nodes, on the way back up, the nodes connect their predecessor.
| Modifier and Type | Field and Description |
|---|---|
static String |
MERGE_ITERATION_AUX_TASKS_KEY |
| Constructor and Description |
|---|
NepheleJobGraphGenerator()
Creates a new job graph generator that uses the default values for its resource configuration.
|
NepheleJobGraphGenerator(Configuration config) |
| Modifier and Type | Method and Description |
|---|---|
JobGraph |
compileJobGraph(OptimizedPlan program)
Translates a
OptimizedPlan into a
JobGraph. |
void |
postVisit(PlanNode node)
This method implements the post-visit during the depth-first traversal.
|
boolean |
preVisit(PlanNode node)
This methods implements the pre-visiting during a depth-first traversal.
|
public static final String MERGE_ITERATION_AUX_TASKS_KEY
public NepheleJobGraphGenerator()
public NepheleJobGraphGenerator(Configuration config)
public JobGraph compileJobGraph(OptimizedPlan program)
OptimizedPlan into a
JobGraph.
This is an 1-to-1 mapping. No optimization whatsoever is applied.program - Optimized PACT plan that is translated into a JobGraph.public boolean preVisit(PlanNode node)
preVisit in interface Visitor<PlanNode>node - The node that is currently processed.Visitor.preVisit(org.apache.flink.util.Visitable)public void postVisit(PlanNode node)
Copyright © 2014 The Apache Software Foundation. All rights reserved.