Scheduling Divisible Workloads on Heterogeneous Platforms
| hal.structure.identifier | Algorithms and high performance computing for grand challenge applications [SCALAPPLIX] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | BEAUMONT, Olivier | |
| hal.structure.identifier | Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL] | |
| dc.contributor.author | LEGRAND, Arnaud | |
| hal.structure.identifier | Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL] | |
| dc.contributor.author | ROBERT, Yves | |
| dc.date.accessioned | 2024-04-15T09:43:57Z | |
| dc.date.available | 2024-04-15T09:43:57Z | |
| dc.date.issued | 2003 | |
| dc.identifier.issn | 0167-8191 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197804 | |
| dc.description.abstractEn | In this paper, we discuss several algorithms for scheduling divisible workloads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a difficult task that was previously left to the user. Because it is periodic, it is simpler to implement, and more robust to changes in the speeds of the processors and/or communication links. On the theoretical side, to the best of our knowledge, this is the first published result assessing the absolute performance of a multi-round algorithm. On the practical side, extensive simulations reveal that our multi-round algorithm outperforms existing solutions on a large variety of platforms, especially when the communication-to-computation ratio is not very high (the difficult case). | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.title.en | Scheduling Divisible Workloads on Heterogeneous Platforms | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1016/S0167-8191(03)00095-4 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.journal | Parallel Computing | |
| bordeaux.page | 1121―1152 | |
| bordeaux.volume | 29 | |
| 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.peerReviewed | oui | |
| hal.identifier | hal-00789431 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00789431v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Parallel%20Computing&rft.date=2003&rft.volume=29&rft.spage=1121%E2%80%951152&rft.epage=1121%E2%80%951152&rft.eissn=0167-8191&rft.issn=0167-8191&rft.au=BEAUMONT,%20Olivier&LEGRAND,%20Arnaud&ROBERT,%20Yves&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||