Non-affine Extensions to Polyhedral Code Generation
No abstract available.
Related papers
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra POPL 2013
- Optimizing GPU Deep Learning Operators with Polyhedral Scheduling Constraint Injection CGO 2022
- Compressed and Parallelized Structured Tensor Algebra OOPSLA 2025
- A polyhedral compilation framework for loops with dynamic data-dependent bounds CC 2018
- PLUTO+: near-complete modeling of affine transformations for parallelism and locality PPoPP 2015
- PolyUFC: Polyhedral Compilation Meets Roofline Analysis for Uncore Frequency Capping CGO 2026
- A practical automatic polyhedral parallelizer and locality optimizer PLDI 2008
- The Pluto+ Algorithm: A Practical Approach for Parallelization and Locality Optimization of Affine Loop Nests TOPLAS 2016