Asymptotically optimal algorithm for Laplace task graphs on heterogeneous platforms
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| dc.contributor.author | BEAUMONT, Olivier | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Algorithms and high performance computing for grand challenge applications [SCALAPPLIX] | |
| dc.contributor.author | RAMET, Pierre | |
| hal.structure.identifier | Algorithms and high performance computing for grand challenge applications [SCALAPPLIX] | |
| hal.structure.identifier | Algorithms and high performance computing for grand challenge applications [SCALAPPLIX] | |
| dc.contributor.author | ROMAN, Jean | |
| dc.date.accessioned | 2024-04-15T09:53:05Z | |
| dc.date.available | 2024-04-15T09:53:05Z | |
| dc.date.issued | 2003 | |
| dc.date.conference | 2003 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198579 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.publisher | Springer Verlag | |
| dc.title.en | Asymptotically optimal algorithm for Laplace task graphs on heterogeneous platforms | |
| dc.type | Communication dans un congrès | |
| bordeaux.page | 880--887 | |
| bordeaux.volume | 3019 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | Fifth International Conference on Parallel Processing and Applied Mathematics, Workshop HeteroPar | |
| bordeaux.country | PL | |
| bordeaux.conference.city | Czestochowa | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | inria-00346587 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00346587v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2003&rft.volume=3019&rft.spage=880--887&rft.epage=880--887&rft.au=BEAUMONT,%20Olivier&RAMET,%20Pierre&ROMAN,%20Jean&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||