SPAGHETtI: Scheduling/Placement Approach for Task-Graphs on HETerogeneous archItecture
| hal.structure.identifier | Efficient runtime systems for parallel architectures [RUNTIME] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | BARTHOU, Denis | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Efficient runtime systems for parallel architectures [RUNTIME] | |
| dc.contributor.author | JEANNOT, Emmanuel | |
| dc.date.accessioned | 2024-04-15T09:57:34Z | |
| dc.date.available | 2024-04-15T09:57:34Z | |
| dc.date.issued | 2014 | |
| dc.date.conference | 2014-08-24 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198922 | |
| dc.description.abstractEn | We propose a new algorithm, called SPAGHETtI, for static scheduling tasks on an unbounded heterogeneous resources where re-sources belongs to different architecture (e.g. CPU or GPU). We show that this algorithm is optimal in complexity O(|E||A| 2 + |V ||A|), where |E| is the number of edges, |V | the number of vertices of the scheduled DAG and |A| the number of architectures – usually a small value – and that it is able to compute the optimal makespan. Moreover, the number of resources to be used for executing the schedule is given by a linear time algorithm. When the resources are bounded we provide a method to reduce the number of necessary resources up to the bound providing a set of compromises between the makespan and the size of the infrastructure. | |
| dc.language.iso | en | |
| dc.title.en | SPAGHETtI: Scheduling/Placement Approach for Task-Graphs on HETerogeneous archItecture | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-319-09873-9_15 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | 174 - 185 | |
| bordeaux.volume | 8632 | |
| 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 | Euro-Par | |
| bordeaux.country | PT | |
| bordeaux.conference.city | Lisboa | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01100948 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2014-08-28 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01100948v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2014&rft.volume=8632&rft.spage=174%20-%20185&rft.epage=174%20-%20185&rft.au=BARTHOU,%20Denis&JEANNOT,%20Emmanuel&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||