Assessing the Impact and Limits of Steady-State Scheduling for Mixed Task and Data Parallelism on Heterogeneous Platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Assessing the Impact and Limits of Steady-State Scheduling for Mixed Task and Data Parallelism on Heterogeneous Platforms

Abstract

In this paper, we consider steady-state scheduling techniques for mapping a collection of task graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to solve this difficult problem. Due to space limitations, we concentrate on complexity results. We show that the problem of optimizing the steady-state throughput is NP-complete in the general case. We formulate a compact version of the problem that belongs to the NP complexity class but which does not restrict the optimality of the solution. We provide many positive results in the extended version (Beaumont et al., 2004). Indeed, we show how to determine in polynomial time the best steady-state scheduling strategy for a large class of application graphs and for an arbitrary platform graphs, using a linear programming approach.
No file

Dates and versions

hal-00789444 , version 1 (18-02-2013)

Identifiers

Cite

Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert. Assessing the Impact and Limits of Steady-State Scheduling for Mixed Task and Data Parallelism on Heterogeneous Platforms. HeteroPar\'2004: International Conference on Heterogeneous Computing, Jointly Published with ISPDC\'2004: International Symposium on Parallel and Distributed Computing, 2004, Unknown, pp.296―302, ⟨10.1109/ISPDC.2004.12⟩. ⟨hal-00789444⟩
228 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More