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

DOI10.1515/AMCS-2016-0065zbMATH Open1355.68044DBLPjournals/amcs/BieleckiP16OpenAlexW2583310649WikidataQ62043975 ScholiaQ62043975MaRDI QIDQ511402FDOQ511402

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)

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

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

zbMATH Keywords

tilingtransitive closureiteration space slicingpolyhedral modelsource-to-source compiler

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

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

Cited In (1)

• Generation of parallel synchronization-free tiled code

Uses Software

• barvinok
• isl
• Omega
• TRACO

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)