Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs

DOI10.1515/AMCS-2016-0065MaRDI QIDQ511402zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Wlodzimierz Bielecki, Marek Palkowski

Publication date 15 February 2017

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/amcs-2016-0065

zbMATH Keywords

tilingtransitive closureiteration space slicingpolyhedral modelsource-to-source compiler

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• On loop transformations of nested loops with affine dependencies
• Tilings from graph directed iterated function systems
• Covering and tiling hypergraphs with tight cycles
• Covering and tiling hypergraphs with tight cycles
• Graph Tilings in Incompatibility Systems
• Tilings in vertex ordered graphs
• Tilings in graphons

Cites work

• scientific article; zbMATH DE number 1740436 (Why is no real title available?)
• scientific article; zbMATH DE number 1956474 (Why is no real title available?)
• scientific article; zbMATH DE number 1984687 (Why is no real title available?)
• scientific article; zbMATH DE number 1520614 (Why is no real title available?)
• An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
• Generating efficient tiled code for distributed memory machines
• Genetic and combinatorial algorithms for optimal sizing and placement of active power filters
• Numerical analysis and scientific computation
• Numerical methods. Design, analysis, and computer implementation of algorithms.
• Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
• Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
• Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm

Cited in

(1)

• Generation of parallel synchronization-free tiled code

Describes a project that uses

Uses Software

• TRACO
• Omega
• isl
• barvinok

This page was built for publication: Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511402)