Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
From MaRDI portal
Publication:511402
DOI10.1515/amcs-2016-0065zbMath1355.68044OpenAlexW2583310649WikidataQ62043975 ScholiaQ62043975MaRDI QIDQ511402
Włodzimierz Bielecki, Marek Pałkowski
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
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
- Genetic and combinatorial algorithms for optimal sizing and placement of active power filters
- 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
- 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
- Numerical Analysis and Scientific Computation
This page was built for publication: Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs