Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm

DOI10.1007/978-3-319-03780-6_12zbMath1406.68017OpenAlexW986638553MaRDI QIDQ2867114

Włodzimierz Bielecki, Tomasz Klimek, Krzysztof Kraska

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_12

zbMATH Keywords

transitive closureFloyd-Warshall algorithmparallelizing compilerarbitrarily nested loopbasis dependence vectors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Generation of parallel synchronization-free tiled code ⋮ Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs

Uses Software

• isl

Cites Work

• Unnamed Item
• Unnamed Item
• On computing the transitive closure of a relation
• A Modular Static Analysis Approach to Affine Loop Invariants Detection
• Iterating Octagons
• Computing the Transitive Closure of a Union of Affine Integer Tuple Relations