public PlanNode(OptimizerNode template, String nodeName, DriverStrategy strategy) { this.outChannels = new ArrayList<Channel>(2); this.broadcastInputs = new ArrayList<NamedChannel>(); this.template = template; this.nodeName = nodeName; this.driverStrategy = strategy; this.parallelism = template.getParallelism(); // check, if there is branch at this node. if yes, this candidate must be associated with // the branching template node. if (template.isBranching()) { this.branchPlan = new HashMap<OptimizerNode, PlanNode>(6); this.branchPlan.put(template, this); } }
@Override public boolean preVisit(OptimizerNode node) { // if the current node is a union if (node instanceof BinaryUnionNode) { int parallelism = -1; // set ship strategy of all outgoing connections to FORWARD. for (DagConnection conn : node.getOutgoingConnections()) { parallelism = conn.getTarget().getParallelism(); conn.setShipStrategy(ShipStrategyType.FORWARD); } // adjust parallelism to be same as successor node.setParallelism(parallelism); } // traverse the whole plan return true; }
final int inParallelism = getPredecessorNode().getParallelism();
+ (n.getParallelism() >= 1 ? n.getParallelism() : "default") + "\"");
final int inDop = getPredecessorNode().getParallelism();
if (n.getParallelism() < 1) {
final int inParallelism1 = getFirstPredecessorNode().getParallelism(); final int inParallelism2 = getSecondPredecessorNode().getParallelism();
if (nextPartialSolution.getParallelism() != getParallelism() || nextPartialSolution == partialSolution || nextPartialSolution instanceof BinaryUnionNode)
final int inParallelism1 = getFirstPredecessorNode().getParallelism(); final int inParallelism2 = getSecondPredecessorNode().getParallelism();
public PlanNode(OptimizerNode template, String nodeName, DriverStrategy strategy) { this.outChannels = new ArrayList<Channel>(2); this.broadcastInputs = new ArrayList<NamedChannel>(); this.template = template; this.nodeName = nodeName; this.driverStrategy = strategy; this.parallelism = template.getParallelism(); // check, if there is branch at this node. if yes, this candidate must be associated with // the branching template node. if (template.isBranching()) { this.branchPlan = new HashMap<OptimizerNode, PlanNode>(6); this.branchPlan.put(template, this); } }
public PlanNode(OptimizerNode template, String nodeName, DriverStrategy strategy) { this.outChannels = new ArrayList<Channel>(2); this.broadcastInputs = new ArrayList<NamedChannel>(); this.template = template; this.nodeName = nodeName; this.driverStrategy = strategy; this.parallelism = template.getParallelism(); // check, if there is branch at this node. if yes, this candidate must be associated with // the branching template node. if (template.isBranching()) { this.branchPlan = new HashMap<OptimizerNode, PlanNode>(6); this.branchPlan.put(template, this); } }
public PlanNode(OptimizerNode template, String nodeName, DriverStrategy strategy) { this.outChannels = new ArrayList<Channel>(2); this.broadcastInputs = new ArrayList<NamedChannel>(); this.template = template; this.nodeName = nodeName; this.driverStrategy = strategy; this.parallelism = template.getParallelism(); // check, if there is branch at this node. if yes, this candidate must be associated with // the branching template node. if (template.isBranching()) { this.branchPlan = new HashMap<OptimizerNode, PlanNode>(6); this.branchPlan.put(template, this); } }
public PlanNode(OptimizerNode template, String nodeName, DriverStrategy strategy) { this.outChannels = new ArrayList<Channel>(2); this.broadcastInputs = new ArrayList<NamedChannel>(); this.template = template; this.nodeName = nodeName; this.driverStrategy = strategy; this.parallelism = template.getParallelism(); // check, if there is branch at this node. if yes, this candidate must be associated with // the branching template node. if (template.isBranching()) { this.branchPlan = new HashMap<OptimizerNode, PlanNode>(6); this.branchPlan.put(template, this); } }
@Override public boolean preVisit(OptimizerNode node) { // if the current node is a union if (node instanceof BinaryUnionNode) { int parallelism = -1; // set ship strategy of all outgoing connections to FORWARD. for (DagConnection conn : node.getOutgoingConnections()) { parallelism = conn.getTarget().getParallelism(); conn.setShipStrategy(ShipStrategyType.FORWARD); } // adjust parallelism to be same as successor node.setParallelism(parallelism); } // traverse the whole plan return true; }
@Override public boolean preVisit(OptimizerNode node) { // if the current node is a union if (node instanceof BinaryUnionNode) { int parallelism = -1; // set ship strategy of all outgoing connections to FORWARD. for (DagConnection conn : node.getOutgoingConnections()) { parallelism = conn.getTarget().getParallelism(); conn.setShipStrategy(ShipStrategyType.FORWARD); } // adjust parallelism to be same as successor node.setParallelism(parallelism); } // traverse the whole plan return true; }
@Override public boolean preVisit(OptimizerNode node) { // if the current node is a union if (node instanceof BinaryUnionNode) { int parallelism = -1; // set ship strategy of all outgoing connections to FORWARD. for (DagConnection conn : node.getOutgoingConnections()) { parallelism = conn.getTarget().getParallelism(); conn.setShipStrategy(ShipStrategyType.FORWARD); } // adjust parallelism to be same as successor node.setParallelism(parallelism); } // traverse the whole plan return true; }
final int inDop = getPredecessorNode().getParallelism();
final int inDop = getPredecessorNode().getParallelism();
if (nextPartialSolution.getParallelism() != getParallelism() || nextPartialSolution == partialSolution || nextPartialSolution instanceof BinaryUnionNode)
if (nextPartialSolution.getParallelism() != getParallelism() || nextPartialSolution == partialSolution || nextPartialSolution instanceof BinaryUnionNode)