SPAGHETtI: Scheduling/Placement Approach for Task-Graphs on HETerogeneous archItecture - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

SPAGHETtI: Scheduling/Placement Approach for Task-Graphs on HETerogeneous archItecture

Résumé

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.
Fichier principal
Vignette du fichier
barthou_jeannot.pdf (437.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01100948 , version 1 (07-01-2015)

Identifiants

Citer

Denis Barthou, Emmanuel Jeannot. SPAGHETtI: Scheduling/Placement Approach for Task-Graphs on HETerogeneous archItecture. Euro-Par, Aug 2014, Lisboa, Portugal. pp.174 - 185, ⟨10.1007/978-3-319-09873-9_15⟩. ⟨hal-01100948⟩
151 Consultations
195 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More