Parallelizing Nested Loops with Approximation of Distance Vectors: A Survey - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Parallel Processing Letters Année : 1997

Parallelizing Nested Loops with Approximation of Distance Vectors: A Survey

Résumé

In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use different representations of distance vectors as input. We study the optimality of each with respect to the dependence analysis it uses. We propose well-chosen examples that illustrate the power and limitations of the three algorithms. This study identifies which algorithm is the most suitable for a given representation of distance vectors.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

Alain Darte, Frédéric Vivien. Parallelizing Nested Loops with Approximation of Distance Vectors: A Survey. Parallel Processing Letters, 1997, 7 (2), pp.133--144. ⟨10.1142/S0129626497000152⟩. ⟨hal-00856889⟩
59 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More