A Proposal for Loop-Transformation Pragmas

05/09/2018
by   Michael Kruse, et al.
0

Pragmas for loop transformations, such as unrolling, are implemented in most mainstream compilers. They're used by application programmers because of their ease of use compared to directly modifying the source code of the relevant loops. We propose additional pragmas for common loop transformations that go far beyond the transformations today's compilers provide and should make most source rewriting for the sake of loop optimization unnecessary. To encourage compilers to implement these pragmas, and to avoid a diversity of incompatible syntaxes, we would like to spark a discussion about inclusion to the OpenMP standard.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2018

User-Directed Loop-Transformations in Clang

Directives for the compiler such as pragmas can help programmers to sepa...
research
11/01/2018

Loop Optimization Framework

The LLVM compiler framework supports a selection of loop transformations...
research
02/24/2021

Learning to Make Compiler Optimizations More Effective

Because loops execute their body many times, compiler developers place m...
research
09/03/2019

De(con)struction of the lazy-F loop: improving performance of Smith Waterman alignment

Striped variation of the Smith-Waterman algorithm is known as extremely ...
research
07/16/2021

Loop Transformations using Clang's Abstract Syntax Tree

OpenMP 5.1 introduced the first loop nest transformation directives unro...
research
11/14/2018

A Performance Vocabulary for Affine Loop Transformations

Modern polyhedral compilers excel at aggressively optimizing codes with ...
research
10/06/2019

Design and Use of Loop-Transformation Pragmas

Adding a pragma directive into the source code is arguably easier than r...

Please sign up or login with your details

Forgot password? Click here to reset