Package org.apache.flink.compiler.plan

Examples of org.apache.flink.compiler.plan.OptimizedPlan

149
150
151
152
153
154
155
156
157
     
      @Override
      public void postVisit(Operator<?> visitable) {}
    });
   
    OptimizedPlan op = compileWithStats(plan);
   
    return (DualInputPlanNode) ((SinkPlanNode) op.getDataSinks().iterator().next()).getInput().getSource();
  }
View Full Code Here
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
    sink.setInput(reduce2);
   
    Plan plan = new Plan(sink, "Test Increasing Degree Of Parallelism");
   
    // submit the plan to the compiler
    OptimizedPlan oPlan = compileNoStats(plan);
   
    // check the optimized Plan
    // when reducer 1 distributes its data across the instances of map2, it needs to employ a local hash method,
    // because map2 has twice as many instances and key/value pairs with the same key need to be processed by the same
    // mapper respectively reducer
    SinkPlanNode sinkNode = oPlan.getDataSinks().iterator().next();
    SingleInputPlanNode red2Node = (SingleInputPlanNode) sinkNode.getPredecessor();
   
    Assert.assertEquals("The Reduce 2 Node has an invalid local strategy.", LocalStrategy.SORT, red2Node.getInput().getLocalStrategy());
  }
View Full Code Here
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
   
   
    // return the PACT plan
    Plan plan = new Plan(sink, "Partition on DoP Change");
   
    OptimizedPlan oPlan = compileNoStats(plan);
   
    NepheleJobGraphGenerator jobGen = new NepheleJobGraphGenerator();
   
    //Compile plan to verify that no error is thrown
    jobGen.compileJobGraph(oPlan);
   
    oPlan.accept(new Visitor<PlanNode>() {
     
      @Override
      public boolean preVisit(PlanNode visitable) {
        if (visitable instanceof DualInputPlanNode) {
          DualInputPlanNode node = (DualInputPlanNode) visitable;
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
        }
      }).name("reducer")
      .print().name("sink");
     
      Plan p = env.createProgramPlan();
      OptimizedPlan op = compileNoStats(p);
     
      OptimizerPlanNodeResolver resolver = getOptimizerPlanNodeResolver(op);
     
     
      // the all-reduce has no combiner, when the DOP of the input is one
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
        }
      }).name("reducer")
      .print().name("sink");
     
      Plan p = env.createProgramPlan();
      OptimizedPlan op = compileNoStats(p);
     
      OptimizerPlanNodeResolver resolver = getOptimizerPlanNodeResolver(op);
     
      // get the original nodes
      SourcePlanNode sourceNode = resolver.getNode("source");
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
        }
      }).name("reducer")
      .print().name("sink");
     
      Plan p = env.createProgramPlan();
      OptimizedPlan op = compileNoStats(p);
     
      OptimizerPlanNodeResolver resolver = getOptimizerPlanNodeResolver(op);
     
      // get the original nodes
      SourcePlanNode sourceNode = resolver.getNode("source");
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
        }
      }).name("reducer")
      .print().name("sink");
     
      Plan p = env.createProgramPlan();
      OptimizedPlan op = compileNoStats(p);
     
      OptimizerPlanNodeResolver resolver = getOptimizerPlanNodeResolver(op);
     
      // get the original nodes
      SourcePlanNode sourceNode = resolver.getNode("source");
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
    union.print();
    union.print();

    Plan plan = env.createProgramPlan();
    try{
      OptimizedPlan oPlan = this.compileNoStats(plan);
      NepheleJobGraphGenerator jobGen = new NepheleJobGraphGenerator();
      jobGen.compileJobGraph(oPlan);
    }catch(CompilerException co){
      co.printStackTrace();
      fail("The Pact compiler is unable to compile this plan correctly.");
View Full Code Here
71
72
73
74
75
76
77
78
79
    sink.setInput(reduce3);
   
    Plan plan = new Plan(sink, "Test Temp Task");
    plan.setDefaultParallelism(DEFAULT_PARALLELISM);
   
    OptimizedPlan oPlan = compileNoStats(plan);
    NepheleJobGraphGenerator jobGen = new NepheleJobGraphGenerator();
    jobGen.compileJobGraph(oPlan);
  }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
        public void reduce(Iterable<Double> values, Collector<Double> out) {}
      }).name("reducer")
      .print().name("sink");
     
      Plan p = env.createProgramPlan();
      OptimizedPlan op = compileNoStats(p);
     
      OptimizerPlanNodeResolver resolver = getOptimizerPlanNodeResolver(op);
     
     
      // the all-reduce has no combiner, when the DOP of the input is one
View Full Code Here
TOP

Related Classes of org.apache.flink.compiler.plan.OptimizedPlan

  • org.apache.flink.client.LocalExecutor
  • org.apache.flink.client.program.ContextEnvironment
  • org.apache.flink.client.program.ExecutionPlanCreationTest
  • org.apache.flink.client.RemoteExecutor
  • org.apache.flink.client.web.JobSubmissionServlet
  • org.apache.flink.compiler.AdditionalOperatorsTest
  • org.apache.flink.compiler.BranchingPlansCompilerTest
  • org.apache.flink.compiler.BroadcastVariablePipelinebreakerTest
  • org.apache.flink.compiler.CachedMatchStrategyCompilerTest
  • org.apache.flink.compiler.CoGroupSolutionSetFirstTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.