Asymptotically optimal algorithm for Laplace task graphs on heterogeneous platforms

Olivier Beaumont 1, 2 Pierre Ramet 1, 3 Jean Roman 3, 4
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
3 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
Université Bordeaux Segalen - Bordeaux 2, Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
4 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
INRIA Futurs, Université Bordeaux Segalen - Bordeaux 2, Université Sciences et Technologies - Bordeaux 1, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : 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.
Keywords : Overlap
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00346587
Contributor : Pierre Ramet <>
Submitted on : Thursday, December 11, 2008 - 6:33:27 PM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM

Identifiers

  • HAL Id : inria-00346587, version 1

Citation

Olivier Beaumont, Pierre Ramet, Jean Roman. Asymptotically optimal algorithm for Laplace task graphs on heterogeneous platforms. Fifth International Conference on Parallel Processing and Applied Mathematics, Workshop HeteroPar, 2003, Czestochowa, Poland. pp.880--887. ⟨inria-00346587⟩

Share

Metrics

Record views

171