public class PlanSelectionFuseNoRedundancy extends PlanSelection
NOTE: This heuristic is essentially the same as FuseAll, except that any plans that refer to a hop with multiple consumers are removed in a pre-processing step.
PlanSelection.VisitMarkCost| Constructor and Description |
|---|
PlanSelectionFuseNoRedundancy() |
| 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 void selectPlans(CPlanMemoTable memo, ArrayList<Hop> roots)
PlanSelectionselectPlans in class PlanSelectionmemo - partial fusion plans Proots - entry points of HOP DAG GCopyright © 2020 The Apache Software Foundation. All rights reserved.