Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms
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 | Department of Computer Science and Engineering [Univ California San Diego] [CSE - UC San Diego] | |
dc.contributor.author | CARTER, Larry | |
hal.structure.identifier | Department of Computer Science and Engineering [Univ California San Diego] [CSE - UC San Diego] | |
dc.contributor.author | FERRANTE, Jeanne | |
hal.structure.identifier | Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL] | |
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:58Z | |
dc.date.available | 2024-04-15T09:43:58Z | |
dc.date.issued | 2004 | |
dc.identifier.issn | 1045-9219 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197806 | |
dc.description.abstractEn | We consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous computing platform. We use a nonoriented graph to model the platform, where resources can have different speeds of computation and communication. Because the number of tasks is large, we focus on the question of determining 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). In contrast to minimizing the total execution time, which is NP-hard in most formulations, we show that finding the optimal steady state can be solved using a linear programming approach and, thus, in polynomial time. Our result holds for a quite general framework, allowing for cycles and multiple paths in the interconnection graph, and allowing for several masters. We also consider the simpler case where the platform is a tree. While this case can also be solved via linear programming, we show how to derive a closed-form formula to compute the optimal steady state, which gives rise to a bandwidth-centric scheduling strategy. The advantage of this approach is that it can directly support autonomous task scheduling based only on information local to each node; no global information is needed. Finally, we provide a theoretical comparison of the computing power of tree-based versus arbitrary platforms. | |
dc.language.iso | en | |
dc.publisher | Institute of Electrical and Electronics Engineers | |
dc.title.en | Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms | |
dc.type | Article de revue | |
dc.identifier.doi | 10.1109/TPDS.2004.1271181 | |
dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
bordeaux.journal | IEEE Transactions on Parallel and Distributed Systems | |
bordeaux.page | 319―330 | |
bordeaux.volume | 15 | |
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-00789427 | |
hal.version | 1 | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-00789427v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=IEEE%20Transactions%20on%20Parallel%20and%20Distributed%20Systems&rft.date=2004&rft.volume=15&rft.spage=319%E2%80%95330&rft.epage=319%E2%80%95330&rft.eissn=1045-9219&rft.issn=1045-9219&rft.au=BANINO,%20Cyril&BEAUMONT,%20Olivier&CARTER,%20Larry&FERRANTE,%20Jeanne&LEGRAND,%20Arnaud&rft.genre=article |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |