Class PlanSelection

    • Constructor Detail

      • PlanSelection

        public PlanSelection()
    • Method Detail

      • selectPlans

        public abstract 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. Z \vDash p, where Z is a set of constraints such as memory budgets and block size restrictions per fused operator.
        memo - partial fusion plans P
        roots - entry points of HOP DAG G