Class PlanSelectionFuseCostBasedV2
- java.lang.Object
- 
- org.apache.sysds.hops.codegen.opt.PlanSelection
- 
- org.apache.sysds.hops.codegen.opt.PlanSelectionFuseCostBasedV2
 
 
- 
 public class PlanSelectionFuseCostBasedV2 extends PlanSelection This cost-based plan selection algorithm chooses fused operators based on the DAG structure and resulting overall costs. This includes holistic decisions on- Materialization points per consumer
- Sparsity exploitation and operator ordering
- Decisions on overlapping template types
- Decisions on multi-aggregates with shared reads
- Constraints (e.g., memory budgets and block sizes)
 
- 
- 
Nested Class Summary- 
Nested classes/interfaces inherited from class org.apache.sysds.hops.codegen.opt.PlanSelectionPlanSelection.VisitMarkCost
 
- 
 - 
Field SummaryFields Modifier and Type Field Description static doubleCOST_MIN_EPSstatic intCOST_MIN_EPS_NUM_POINTSstatic booleanCOST_PRUNINGstatic booleanPLAN_CACHINGstatic booleanSTRUCTURAL_PRUNING
 - 
Constructor SummaryConstructors Constructor Description PlanSelectionFuseCostBasedV2()
 - 
Method SummaryAll Methods Instance Methods Concrete Methods Modifier and Type Method Description voidselectPlans(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.
 
- 
- 
- 
Field Detail- 
COST_MIN_EPSpublic static final double COST_MIN_EPS - See Also:
- Constant Field Values
 
 - 
COST_MIN_EPS_NUM_POINTSpublic static final int COST_MIN_EPS_NUM_POINTS - See Also:
- Constant Field Values
 
 - 
COST_PRUNINGpublic static boolean COST_PRUNING 
 - 
STRUCTURAL_PRUNINGpublic static boolean STRUCTURAL_PRUNING 
 - 
PLAN_CACHINGpublic static boolean PLAN_CACHING 
 
- 
 - 
Method Detail- 
selectPlanspublic void selectPlans(CPlanMemoTable memo, ArrayList<Hop> roots) Description copied from class:PlanSelectionGiven 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. Z \vDash p, where Z is a set of constraints such as memory budgets and block size restrictions per fused operator.- Specified by:
- selectPlansin class- PlanSelection
- Parameters:
- memo- partial fusion plans P
- roots- entry points of HOP DAG G
 
 
- 
 
-