BEAUMONT, Olivier; RAMET, Pierre; ROMAN, Jean

Métadonnées

Licence d’utilisation du document

BEAUMONT, Olivier
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]

RAMET, Pierre
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

ROMAN, Jean
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

Langue

Communication dans un congrès

Ce document a été publié dans

Fifth International Conference on Parallel Processing and Applied Mathematics, Workshop HeteroPar, 2003, Czestochowa. 2003, vol. 3019, p. 880--887

Springer Verlag

Résumé en anglais

In this paper, we focus on the scheduling of Laplace task graph on a general platform where both communication links and processing units are heterogeneous. In this context, it is known that deriving optimal algorithm, in the sense of makespan minimization, is NP-Complete, and several inapproximation results have been proved. Nevertheless, we provide an asymtotically optimal algorithm in this general context. Moreover, we expect that this methodolgy can be extended to more general task graphs, especially for nested loops where the inner-most loop is parallel.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Asymptotically optimal algorithm for Laplace task graphs on heterogeneous platforms

Langue

Ce document a été publié dans

Résumé en anglais

URI

Origine

Unités de recherche