Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies

DOI10.1007/s10766-006-0012-3zbMath1105.68019OpenAlexW2071110673MaRDI QIDQ853766

Sylvain Girbal, Olivier Temam, Marc Sigler, Cédric Bastoul, Albert Cohen, David Parello, Nicolas Vasilache

Publication date: 17 November 2006

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10766-006-0012-3

zbMATH Keywords

compiler optimizationpolyhedral modelautomatic parallelizationsemi-automatic program transformation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Uses Software

• Stratego
• FADAlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
• Adaptive optimizing compilers for the 21st century
• Automatic storage management for parallel programs
• Dataflow analysis of array and scalar references
• Mapping uniform loop nests onto distributed memory architectures
• Automating non-unimodular loop transformations for massive parallelism
• A singular loop transformation framework based on non-singular matrices
• Fuzzy array dataflow analysis
• Automatic intra-register vectorization for the Intel\(^\circledR\) architecture
• Automatic translation of FORTRAN programs to vector form
• Euro-Par 2004 Parallel Processing
• Euro-Par 2004 Parallel Processing
• Languages and Compilers for Parallel Computing

This page was built for publication: Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies