XMLWordPrintableJSON

Details

    • Sub-task
    • Status: Closed
    • Major
    • Resolution: Done
    • None
    • SystemML 0.14
    • Compiler, Runtime
    • None

    Description

      The current cplan construction per template has grown with additional requirements and supported operations. Recent extensions have shown that this is not a good basis for further development, especially with regard to advanced cost-based optimizations and the generation of distributed operations.

      Existing problems include a hand-wired plan construction disregarding alternatives, redundant code for matching opening and closing conditions, redundant O(n^2) traversal of dags, mixed bottom-up and top-down traversal per template, and various special cases to merge templates of different types after the actual cplan construction.

      This task aims to introduces a lean core algorithm that (1) enumerates candidates, and (2) selects the "best" candidate, and finally (3) constructs the cplan for the chosen candidate. At the same time, the goal is to significantly simplify future extensions of existing and new templates.

      Attachments

        Issue Links

          Activity

            People

              mboehm7 Matthias Boehm
              mboehm7 Matthias Boehm
              Votes:
              0 Vote for this issue
              Watchers:
              1 Start watching this issue

              Dates

                Created:
                Updated:
                Resolved: