Scheduling on Two Unbounded Resources with Communication Costs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Scheduling on Two Unbounded Resources with Communication Costs

Résumé

Heterogeneous computing systems are popular and powerful platforms, containing several heterogeneous computing elements (e.g. CPU+GPU). In this work, we consider a platform with two types of machines , each containing an unbounded number of elements. We want to execute an application represented as a Directed Acyclic Graph (DAG) on this platform. Each task of the application has two possible execution times, depending on the type of machine it is executed on. In addition we consider a cost to transfer data from one platform to the other between successive tasks. We aim at minimizing the execution time of the DAG (also called makespan). We show that the problem is NP-complete for graphs of depth at least three but polynomial for graphs of depth at most two. In addition, we provide polynomial-time algorithms for some usual classes of graphs (trees, series-parallel graphs).
Fichier principal
Vignette du fichier
main.pdf (534.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02141622 , version 1 (28-05-2019)

Identifiants

  • HAL Id : hal-02141622 , version 1

Citer

Massinissa Ait Aba, Alix Munier-Kordon, Guillaume Pallez. Scheduling on Two Unbounded Resources with Communication Costs. Euro-Par - European Conference on Parallel Processing, Aug 2019, Gottingen, Germany. ⟨hal-02141622⟩
142 Consultations
284 Téléchargements

Partager

Gmail Facebook X LinkedIn More