Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model
| 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 | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| dc.contributor.author | BONICHON, Nicolas | |
| 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 | EYRAUD-DUBOIS, Lionel | |
| dc.date.accessioned | 2024-04-15T09:54:00Z | |
| dc.date.available | 2024-04-15T09:54:00Z | |
| dc.date.issued | 2008 | |
| dc.date.conference | 2008-04-15 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198642 | |
| dc.description.abstractEn | In this paper, we discuss complexity issues for scheduling divisible workloads on heterogeneous systems under the bounded multi-port model. To our best knowledge, this paper is the first attempt to consider divisible load scheduling under a realistic communication model, where the master node can communicate simultaneously to several slaves, provided that bandwidth constraints are not exceeded. In this paper, we concentrate on one round distribution schemes, where a given node starts its processing only once all data has been received. Our main contributions are (i) the proof that processors start working immediately after receiving their work (ii) the study of the optimal schedule in the case of 2 processors and (iii) the proof that scheduling divisible load under the bounded multi-port model is NP-complete. This last result strongly differs from divisible load literature and represents the first NP-completeness result when latencies are not taken into account. | |
| dc.description.sponsorship | ALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006 | |
| dc.language.iso | en | |
| dc.title.en | Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model | |
| dc.type | Communication dans un congrès | |
| 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.conference.title | Heterogeneity in Computing Workshop, in IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008. | |
| bordeaux.country | US | |
| bordeaux.conference.city | Miami, FL | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | inria-00336189 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00336189v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2008&rft.au=BEAUMONT,%20Olivier&BONICHON,%20Nicolas&EYRAUD-DUBOIS,%20Lionel&rft.genre=unknown |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||