Skip to Main content Skip to Navigation
New interface
Conference papers

Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing

Anna Beletska 1 Wlodzirmierz Bielecki 2 Albert Cohen 1 Palkowski Marek 2 
1 ALCHEMY - Architectures, Languages and Compilers to Harness the End of Moore Years
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : This paper contributes to the theory and practice of automatic extraction of synchronization-free parallelism in nested loops. It extends the iteration-space slicing framework to extract slices described by not only affine (linear) but also non-affine forms. A slice is represented by a set of dependent loop statement instances (iterations) forming an arbitrary graph topology. The algorithm generates an outer loop to spawn synchronization-free slices to be executed in parallel, enclosing sequential loops iterating over those slices. Experimental results demonstrate that the generated code is competitive with that generated by state-of-the-art techniques scanning polyhedra.
Document type :
Conference papers
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Albert Cohen Connect in order to contact the contributor
Submitted on : Sunday, November 27, 2011 - 9:09:22 PM
Last modification on : Tuesday, October 25, 2022 - 4:18:42 PM
Long-term archiving on: : Tuesday, February 28, 2012 - 2:22:46 AM


Files produced by the author(s)


  • HAL Id : hal-00645322, version 1


Anna Beletska, Wlodzirmierz Bielecki, Albert Cohen, Palkowski Marek. Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing. The 22nd International Workshop on Languages and Compilers for Parallel Computing, Oct 2009, Newark, Delaware, United States. ⟨hal-00645322⟩



Record views


Files downloads