Loop parallelization algorithms: From parallelism extraction to code generation

Pierre Boulet, Alain Darte, Georges-André Silber, Frédéric Vivien
1998 Parallel Computing  
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations they use, the loop transformations they generate, the code generation schemes they require, and their ability to incorporate various optimizing criteria such as maximal parallelism detection, permutable loop detection, minimization of synchronizations, easiness of code generation, etc. We complete the discussion by presenting new results related to code generation and loop fusion for a particular
more » ... lass of multidimensional schedules called shifted linear schedules. We demonstrate that algorithms based on such schedules lead to simple codes. q 1998 Elsevier Science B.V. All rights reserved. 0167-8191r98r$19.00 q 1998 Elsevier Science B.V. All rights reserved. Ž . PII S 0 1 6 7 -8 1 9 1 9 8 0 0 0 2 0 -9 ( ) P. Boulet et al.r Parallel Computing 24 1998 421-444 422
doi:10.1016/s0167-8191(98)00020-9 fatcat:bxqeg7gta5f7dmqa6lwy6oewpm