Scheduling on Two Unbounded Resources with Communication Costs - Archive ouverte HAL Access content directly
Conference Papers Year :

Scheduling on Two Unbounded Resources with Communication Costs

(1) , (2) , (3)
1
2
3

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-02141622 , version 1

Cite

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⟩
134 View
279 Download

Share

Gmail Facebook Twitter LinkedIn More