Name
Abstract | ||
|---|---|---|
Many machine learning (ML) systems allow the specification of ML algorithms by means of linear algebra programs, and automatically generate efficient execution plans. The opportunities for fused operators---in terms of fused chains of basic operators---are ubiquitous, and include fewer materialized intermediates, fewer scans of inputs, and sparsity exploitation across operators. However, existing fusion heuristics struggle to find good plans for complex operator DAGs or hybrid plans of local and distributed operations. In this paper, we introduce an exact yet practical cost-based optimization framework for fusion plans and describe its end-to-end integration into Apache SystemML. We present techniques for candidate exploration and selection of fusion plans, as well as code generation of local and distributed operations over dense, sparse, and compressed data. Our experiments in SystemML show end-to-end performance improvements of up to 22x, with negligible compilation overhead. |
Year | Venue | DocType |
|---|---|---|
2018 | PVLDB | Journal |
Volume | Issue | Citations |
abs/1801.00829 | 12 | 0 |
PageRank | References | Authors |
0.34 | 45 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Boehm | 1 | 127 | 6.17 |
| Berthold Reinwald | 2 | 901 | 79.37 |
| Dylan Hutchison | 3 | 0 | 0.68 |
| Alexandre V. Evfimievski | 4 | 501 | 41.76 |
| Prithviraj Sen | 5 | 837 | 38.24 |