[Sans titre]
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | BANINO, Cyril | |
| 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 | BEAUMONT, Olivier | |
| hal.structure.identifier | Regularity and massive parallel computing [REMAP] | |
| dc.contributor.author | LEGRAND, Arnaud | |
| hal.structure.identifier | Regularity and massive parallel computing [REMAP] | |
| dc.contributor.author | ROBERT, Yves | |
| dc.date.accessioned | 2024-04-15T09:43:50Z | |
| dc.date.available | 2024-04-15T09:43:50Z | |
| dc.date.issued | 2002 | |
| dc.date.conference | 2002-06-15 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197795 | |
| dc.description.abstractEn | In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a non-oriented graph to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We show how to determine the optimal steady-state scheduling strategy for each processor. Because spanning trees are easier to deal with in practice, a natural question arises: how to extract the best spanning tree, i.e. the one with optimal steady-state throughput, out of a general interconnection graph? We show that this problem is NP-Complete. Still, we introduce and compare several low-complexity heuristics to determine a sub-optimal spanning tree. | |
| dc.language.iso | en | |
| dc.publisher | Springer Verlag | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/3-540-48051-X_42 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | 423―432 | |
| 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 | PARA\'02: International Conference on Applied Parallel Computing | |
| bordeaux.country | FI | |
| bordeaux.conference.city | Espoo | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00789455 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2002-06-18 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00789455v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2002&rft.spage=423%E2%80%95432&rft.epage=423%E2%80%95432&rft.au=BANINO,%20Cyril&BEAUMONT,%20Olivier&LEGRAND,%20Arnaud&ROBERT,%20Yves&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||