7938758
doi
10.1007/978-3-031-24950-1_1
oai:zenodo.org:7938758
Rubiano, Thomas
Rusch, Neea
Seiller, Thomas
Distributing and Parallelizing Non-canonical Loops
Aubert, Clément
info:eu-repo/semantics/openAccess
Creative Commons Attribution No Derivatives 4.0 International
https://creativecommons.org/licenses/by-nd/4.0/legalcode
This work leverages an original dependency analysis to parallelize loops regardless of their form in imperative programs. Our algorithm distributes a loop into multiple parallelizable loops, resulting in gains in execution time comparable to state-of-the-art automatic source-to-source code transformers when both are applicable. Our graph-based algorithm is intuitive, language-agnostic, proven correct, and applicable to all types of loops. Importantly, it can be applied even if the loop iteration space is unknown statically or at compile time, or more generally if the loop is not in canonical form or contains loop-carried dependency. As contributions we deliver the computational technique, proof of its preservation of semantic correctness, and experimental results to quantify the expected performance gains. We also show that many comparable tools cannot distribute the loops we optimize, and that our technique can be seamlessly integrated into compiler passes or other automatic parallelization suites.
Zenodo
2023-01-01
info:eu-repo/semantics/conferencePaper
7938757
1684376800.808158
623172
md5:d2fc86d852d8ee11d60cb125a59f6fcd
https://zenodo.org/records/7938758/files/distributing-and-parallelizing-non-canonical-loops.pdf
public
Lecture Notes in Computer Science
1-24
2023-01-01