| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations
Abstract : Automatic coarse-grained parallelization of pro- gram loops is of great importance for multi-core computing systems. This paper presents a comparison of Iteration Space Slicing and Affine Transformation Framework algorithms aimed at extracting coarse-grained parallelism available in arbitrarily nested parameterized affine loops. We demonstrate that Iteration Space Slicing permits for extracting more coarse-grained paral- lelism in comparison to the Affine Transformation Framework. Experimental results show that by means of Iteration Space Slicing algorithms, we are able to extract coarse-grained paral- lelism for most loops of the NAS and UTDSP benchmarks, and that there is a strong need in devising advanced algorithms for calculating the exact transitive closure of dependence relations in order to increase the applicability of that framework.
Cited literature [22 references]
https://hal.inria.fr/hal-00645329
Contributor : Albert Cohen <>
Submitted on : Sunday, November 27, 2011 - 9:43:06 PM
Last modification on : Thursday, July 8, 2021 - 3:48:43 AM
Long-term archiving on: : Tuesday, February 28, 2012 - 2:22:56 AM
Contributor : Albert Cohen <>
Submitted on : Sunday, November 27, 2011 - 9:43:06 PM
Last modification on : Thursday, July 8, 2021 - 3:48:43 AM
Long-term archiving on: : Tuesday, February 28, 2012 - 2:22:56 AM
File
ISPDC_2009.pdf
Files produced by the author(s)