Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
Ist Teil von
International journal of parallel programming, 2006-06, Vol.34 (3), p.261-317
Ort / Verlag
New York: Springer Nature B.V
Erscheinungsjahr
2006
Link zum Volltext
Quelle
SpringerLink
Beschreibungen/Notizen
Modern compilers are responsible for translating the idealistic operational semantics of the source program into a form that makes efficient use of a highly complex heterogeneous machine. Since optimization problems are associated with huge and unstructured search spaces, this combinational task is poorly achieved in general, resulting in weak scalability and disappointing sustained performance. This challenge is addressed by working on the program representation itself, using a semi-automatic optimization approach to demonstrate that current compilers offen suffer from unnecessary constraints and intricacies that can be avoided in a semantically richer transformation framework. Technically, the purpose of this paper is threefold: 1. to show that syntactic code representations close to the operational semantics lead to rigid phase ordering and cumbersome expression of architecture-aware loop transformations, 2. to illustrate how complex transformation sequences may be needed to achieve significant performance benefits, and 3. to facilitate the automatic search for program transformation sequences, improving on classical polyhedral representations to better support operation research strategies in a simpler, structured search space.