Scheduling strategies for mixed data and task parallelism on heterogeneous processor grids
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 | Regularity and massive parallel computing [REMAP] | |
hal.structure.identifier | Laboratoire de l'Informatique du Parallélisme [LIP] | |
dc.contributor.author | LEGRAND, Arnaud | |
hal.structure.identifier | Regularity and massive parallel computing [REMAP] | |
hal.structure.identifier | Laboratoire de l'Informatique du Parallélisme [LIP] | |
dc.contributor.author | ROBERT, Yves | |
dc.date.accessioned | 2024-04-15T09:43:33Z | |
dc.date.available | 2024-04-15T09:43:33Z | |
dc.date.issued | 2002 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197775 | |
dc.description.abstractEn | In this paper, we consider the execution of a complex application on a heterogeneous grid computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) between these tasks. A typical example is the repeated execution of the same algorithm on several distinct data samples. We use a non-oriented graph to model the grid platform, where resources have different speeds of computation and communication. We show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the platform graph. | |
dc.language.iso | en | |
dc.title.en | Scheduling strategies for mixed data and task parallelism on heterogeneous processor grids | |
dc.type | Rapport | |
dc.subject.hal | Informatique [cs]/Algorithme et structure de données [cs.DS] | |
dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
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.type.report | rr | |
hal.identifier | hal-00807405 | |
hal.version | 1 | |
hal.audience | Non spécifiée | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-00807405v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2002&rft.au=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. |