Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue International Journal of Parallel Programming Année : 1997

Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs

Alain Darte

Résumé

This paper presents an optimal algorithm for detecting line or medium grain parallelism in nested loops whose dependences are described by an approximation of distance vectors by polyhedra. In particular, this algorithm is optimal for the classical approximation by direction sectors. This result generalizes, to the case of several statements. Wolf and Lam's algorithm which is optimal for a single statement. Our algorithm relies on a dependence uniformization process and on parallelization techniques related to system of uniform recurrence equations. It can also be viewed as a combination of both Allen and Kennedy's algorithm and Wolf and Lam's algorithm.

Dates et versions

hal-00856886 , version 1 (02-09-2013)

Identifiants

Citer

Alain Darte, Frédéric Vivien. Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs. International Journal of Parallel Programming, 1997, 25 (6), pp.447--496. ⟨10.1023/A:1025168022993⟩. ⟨hal-00856886⟩
51 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More