Skip to Main content Skip to Navigation
Conference papers

Scheduling on Two Unbounded Resources with Communication Costs

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).
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Guillaume Pallez (aupy) Connect in order to contact the contributor
Submitted on : Tuesday, May 28, 2019 - 8:50:57 AM
Last modification on : Wednesday, January 26, 2022 - 3:36:42 AM


Files produced by the author(s)


  • HAL Id : hal-02141622, version 1


Massinissa 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⟩



Les métriques sont temporairement indisponibles