Autor:
Bielecki, Włodzimierz ; Pałkowski, Marek
Współtwórca:
Korbicz, Józef - red. ; Uciński, Dariusz - red.
Tytuł:
Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
Tytuł publikacji grupowej:
Temat i słowa kluczowe:
tiling ; transitive closure ; source-to-source compiler ; polyhedral model ; iteration space slicing
Abstract:
A novel approach to generation of tiled code for arbitrarily nested loops is presented. It is derived via a combination of the polyhedral and iteration space slicing frameworks. Instead of program transformations represented by a set of affine functions, one for each statement, it uses the transitive closure of a loop nest dependence graph to carry out corrections of original rectangular tiles so that all dependences of the original loop nest are preserved under the lexicographic order of target tiles. ; Parallel tiled code can be generated on the basis of valid serial tiled code by means of applying affine transformations or transitive closure using on input an inter-tile dependence graph whose vertices are represented by target tiles while edges connect dependent target tiles. We demonstrate how a relation describing such a graph can be formed. The main merit of the presented approach in comparison with the well-known ones is that it does not require full permutability of loops to generate both serial and parallel tiled codes; this increases the scope of loop nests to be tiled.
Wydawca:
Zielona Góra: Uniwersytet Zielonogórski
Typ zasobu:
DOI:
Strony:
Źródło:
AMCS, volume 26, number 4 (2016) ; kliknij tutaj, żeby przejść