Generation of parallel synchronization-free tiled code

DOI10.1007/s00607-017-0576-3OpenAlexW2766562669WikidataQ62043958 ScholiaQ62043958MaRDI QIDQ1640015

Piotr Skotnicki, Marek Pałkowski, Włodzimierz Bielecki

Publication date: 13 June 2018

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-017-0576-3

zbMATH Keywords

tilingtransitive closureiteration space slicingpolyhedral modeloptimizing compilersynchronization-free parallelism

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel numerical computation (65Y05) Combinatorial aspects of tessellation and tiling problems (05B45) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Uses Software

• isl
• TRACO

Cites Work

• Unnamed Item
• Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm
• The Relation Between Diamond Tiling and Hexagonal Tiling
• isl: An Integer Set Library for the Polyhedral Model