Examples of eu.stratosphere.compiler.plantranslate.NepheleJobGraphGenerator

Package eu.stratosphere.compiler.plantranslate

Examples of eu.stratosphere.compiler.plantranslate.NepheleJobGraphGenerator

eu.stratosphere.compiler.plantranslate.NepheleJobGraphGenerator
This component translates the optimizer's resulting plan a nephele job graph. The translation is a one to one mapping. All decisions are made by the optimizer, this class simply creates nephele data structures and descriptions corresponding to the optimizer's result.
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.

      // return the PACT plan
      Plan plan = new Plan(sink, "Branching Union");
      
      OptimizedPlan oPlan = compileNoStats(plan);
      
      NepheleJobGraphGenerator jobGen = new NepheleJobGraphGenerator();
      
      //Compile plan to verify that no error is thrown
      jobGen.compileJobGraph(oPlan);
    } catch (Exception e) {
      e.printStackTrace();
      Assert.fail(e.getMessage());
    }
  }

View Full Code Here

        Assert.assertTrue("Invalid data sink.", allSinks.remove(path));
      }
      
      // ---------- compile plan to nephele job graph to verify that no error is thrown ----------
      
      NepheleJobGraphGenerator jobGen = new NepheleJobGraphGenerator();
      jobGen.compileJobGraph(oPlan);
    } catch (Exception e) {
      e.printStackTrace();
      Assert.fail(e.getMessage());
    }
  }

View Full Code Here

    // optimize and compile plan 
    PactCompiler pc = new PactCompiler(new DataStatistics());
    OptimizedPlan op = pc.compile(plan);
    
    // return job graph of failing job
    NepheleJobGraphGenerator jgg = new NepheleJobGraphGenerator();
    return jgg.compileJobGraph(op);
  }

View Full Code Here

    // optimize and compile plan
    PactCompiler pc = new PactCompiler(new DataStatistics());
    OptimizedPlan op = pc.compile(plan);


    // return job graph of working job
    NepheleJobGraphGenerator jgg = new NepheleJobGraphGenerator();
    return jgg.compileJobGraph(op);
  }

View Full Code Here

    // 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) {

View Full Code Here

    
    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

    plan.setDefaultParallelism(DEFAULT_PARALLELISM);
    
    
    try {
      OptimizedPlan oPlan = compileNoStats(plan);
      NepheleJobGraphGenerator jobGen = new NepheleJobGraphGenerator();
      jobGen.compileJobGraph(oPlan);
    } catch(CompilerException ce) {
      ce.printStackTrace();
      fail("The pact compiler is unable to compile this plan correctly");
    }
  }

View Full Code Here

    Plan plan = new Plan(output);


    PactCompiler pc = new PactCompiler(new DataStatistics());
    OptimizedPlan op = pc.compile(plan);


    NepheleJobGraphGenerator jgg = new NepheleJobGraphGenerator();
    return jgg.compileJobGraph(op);


  }

View Full Code Here

    ShipStrategyType ss2 = deltaMapper.getOutgoingChannels().get(0).getShipStrategy();
    
    assertTrue( (ss1 == ShipStrategyType.FORWARD && ss2 == ShipStrategyType.PARTITION_HASH) ||
          (ss2 == ShipStrategyType.FORWARD && ss1 == ShipStrategyType.PARTITION_HASH) );
    
    new NepheleJobGraphGenerator().compileJobGraph(oPlan);
  }

View Full Code Here

    // verify solution delta
    assertEquals(2, joinWithSolutionSetNode.getOutgoingChannels().size());
    assertEquals(ShipStrategyType.PARTITION_HASH, joinWithSolutionSetNode.getOutgoingChannels().get(0).getShipStrategy());
    assertEquals(ShipStrategyType.PARTITION_HASH, joinWithSolutionSetNode.getOutgoingChannels().get(1).getShipStrategy());
    
    new NepheleJobGraphGenerator().compileJobGraph(oPlan);
  }

View Full Code Here

0 1 2 3

TOP

Related Classes of eu.stratosphere.compiler.plantranslate.NepheleJobGraphGenerator

eu.stratosphere.api.common.aggregators.AggregatorRegistry

eu.stratosphere.api.common.distributions.DataDistribution

eu.stratosphere.client.LocalExecutor

eu.stratosphere.client.program.Client

eu.stratosphere.compiler.dag.TempMode

eu.stratosphere.compiler.plan.BulkIterationPlanNode

eu.stratosphere.compiler.plan.BulkPartialSolutionPlanNode

eu.stratosphere.compiler.plan.Channel

eu.stratosphere.compiler.plan.DualInputPlanNode

eu.stratosphere.compiler.plan.PlanNode

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.