public class PlanSelectionFuseCostBasedV2 extends PlanSelection
PlanSelection.VisitMarkCost| Modifier and Type | Field and Description | 
|---|---|
| static double | COST_MIN_EPS | 
| static int | COST_MIN_EPS_NUM_POINTS | 
| static boolean | COST_PRUNING | 
| static boolean | PLAN_CACHING | 
| static boolean | STRUCTURAL_PRUNING | 
| Constructor and Description | 
|---|
| PlanSelectionFuseCostBasedV2() | 
| Modifier and Type | Method and Description | 
|---|---|
| void | selectPlans(CPlanMemoTable memo,
           ArrayList<Hop> roots)Given a HOP DAG G, and a set of partial fusions plans P, find the set of optimal, 
 non-conflicting fusion plans P' that applied to G minimizes costs C with
 P' = \argmin_{p \subseteq P} C(G, p) s.t. | 
public static final double COST_MIN_EPS
public static final int COST_MIN_EPS_NUM_POINTS
public static boolean COST_PRUNING
public static boolean STRUCTURAL_PRUNING
public static boolean PLAN_CACHING
public void selectPlans(CPlanMemoTable memo, ArrayList<Hop> roots)
PlanSelectionselectPlans in class PlanSelectionmemo - partial fusion plans Proots - entry points of HOP DAG GCopyright © 2021 The Apache Software Foundation. All rights reserved.