Multi-criteria scheduling of pipeline workflows

Authors:
Anne Benoit;Veronika Rehn-Sonigo;Yves Robert
Affiliations:
LIP, ENS Lyon, 46 Allée d'Italie, 69364 Cedex 07, France;LIP, ENS Lyon, 46 Allée d'Italie, 69364 Cedex 07, France;LIP, ENS Lyon, 46 Allée d'Italie, 69364 Cedex 07, France
Venue:
CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
Year:
2007

Citing 0
Cited 6

Bi-criteria Pipeline Mappings for Parallel Image Processing

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Multi-Criteria Scheduling of Pipeline Workflows (and Application To the JPEG Encoder)

International Journal of High Performance Computing Applications
Optimizing latency and throughput of application workflows on clusters

Parallel Computing
A Multi-objective Approach for Workflow Scheduling in Heterogeneous Environments

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
A survey of pipelined workflow scheduling: Models and algorithms

ACM Computing Surveys (CSUR)
Predicate-aware, makespan-preserving software pipelining of scheduling tables

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonist criteria should be optimized, such as throughput and latency (or a combination). In this paper, we study the complexity of the bi-criteria mapping problem for pipeline graphs on communication homogeneous platforms. In particular, we assess the complexity of the well-known chains-to-chains problem for different-speed processors, which turns out to be NP-hard. We provide several efficient polynomial bi-criteria heuristics, and their relative performance is evaluated through extensive simulations.