Name
Abstract | ||
|---|---|---|
Modern polyhedral compilers excel at aggressively optimizing codes with static control parts, but the state-of-practice to find high-performance polyhedral transformations especially for different hardware targets still largely involves auto-tuning. In this work we propose a novel customizable polyhedral scheduling technique, with the aim of delivering high performance for several hardware targets. We design constraints and objectives that model several crucial aspects of performance such as stride optimization or the trade-off between parallelism and reuse, while considering important architectural features of the target machine. We evaluate our work using the PolyBench/C benchmark suite and experimentally validate it against large optimization spaces generated with the Pluto compiler on 3 representative architectures: an IBM Power9, an Intel Xeon Phi and an Intel Core-i9. Our results show we can achieve comparable or superior performance to Pluto on the majority of benchmarks, without implementing tiling in the source code nor using experimental autotuning.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3314221.3314653 | Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation |
Keywords | Field | DocType |
Affine transformations, composable transformations, polyhedral optimizations, scheduling, single-shot ILP | Affine transformation,IBM,Suite,Reuse,Source code,Computer science,Scheduling (computing),Xeon Phi,Parallel computing,Theoretical computer science,Compiler | Conference |
ISBN | Citations | PageRank |
978-1-4503-6712-7 | 3 | 0.41 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Kong | 1 | 89 | 6.18 |
| Louis-noël Pouchet | 2 | 880 | 47.61 |