Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
From MaRDI portal
Publication:511402
DOI10.1515/AMCS-2016-0065zbMATH Open1355.68044DBLPjournals/amcs/BieleckiP16OpenAlexW2583310649WikidataQ62043975 ScholiaQ62043975MaRDI QIDQ511402FDOQ511402
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
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)
Uses Software
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)
