Multi-criteria scheduling of pipeline workflows

Details Multi-criteria scheduling of pipeline workflows Multi-criteria scheduling of pipeline workflows

2007-06-27

arxiv.org/abs/0706.4009v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multi-criteria scheduling of pipeline workflows does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multi-criteria scheduling of pipeline workflows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-criteria scheduling of pipeline workflows will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-255834