Loop transformations, convexity, pruning and optimization
From MaRDI portal
Recommendations
- PIT: a framework for effectively composing high-level loop transformations
- Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
- scientific article; zbMATH DE number 1218791
- Languages and Compilers for Parallel Computing
- Transforming complex loop nests for locality
Cited in
(18)- Transforming complex loop nests for locality
- A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details
- A methodology for speeding up loop kernels by exploiting the software information and the memory architecture
- Optimizing nested loops using local CPS conversion
- Weight optimisation in \(\mathcal H_{\infty}\) loop-shaping
- In search of a program generator to implement generic transformations for high-performance computing
- Superoptimization in LLVM
- Randomized accuracy-aware program transformations for efficient approximate computations
- PIT: a framework for effectively composing high-level loop transformations
- scientific article; zbMATH DE number 1304271 (Why is no real title available?)
- scientific article; zbMATH DE number 1943827 (Why is no real title available?)
- scientific article; zbMATH DE number 1863272 (Why is no real title available?)
- Euro-Par 2004 Parallel Processing
- Euro-Par 2004 Parallel Processing
- Euro-Par 2004 Parallel Processing
- Languages and Compilers for Parallel Computing
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type
- Integrating loop and data transformations for global optimization
This page was built for publication: Loop transformations, convexity, pruning and optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408575)