Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism
No abstract available.
Related papers
- HieraSynth: A Parallel Framework for Complete Super-Optimization with Hierarchical Space Decomposition OOPSLA 2025
- Transforming Query Sequences for High-Throughput B+ Tree Processing on Many-Core Processors CGO 2019
- The Pluto+ Algorithm: A Practical Approach for Parallelization and Locality Optimization of Affine Loop Nests TOPLAS 2016
- Extending Graham-Glanville techniques for optimal code generation TOPLAS 2000
- Automatic Parallelization and Optimization of Programs by Proof Rewriting SAS 2009
- Optimizing GPU Deep Learning Operators with Polyhedral Scheduling Constraint Injection CGO 2022
- On the parallel I/O optimality of linear algebra kernels: near-optimal LU factorization PPoPP 2021
- Space-Time Tradeoffs for Linear Recursion POPL 1979