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

Authors:
O. Beaumont;A. Legrand;L. Marchal;Y. Robert
Affiliations:
LaBRI, UMR CNRS;LIP, UMR CNRS-INRIA;LIP, UMR CNRS-INRIA;LIP, UMR CNRS-INRIA
Venue:
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Year:
2004

Citing 0
Cited 5

Adaptive Allocation of Independent Tasks to Maximize Throughput

IEEE Transactions on Parallel and Distributed Systems
Mapping pipeline skeletons onto heterogeneous platforms

Journal of Parallel and Distributed Computing
Multi-Criteria Scheduling of Pipeline Workflows (and Application To the JPEG Encoder)

International Journal of High Performance Computing Applications
A genetic algorithm with communication costs to schedule workflows on a SOA-Grid

Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
A survey of pipelined workflow scheduling: Models and algorithms

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

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 [5]. 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.