Multi-criteria scheduling of pipeline workflows
| dc.creator | Benoit, Anne | |
| dc.creator | Rehn-Sonigo, Veronika | |
| dc.creator | Robert, Yves | |
| dc.date | 2007-06-27 | |
| dc.date | 2007-06-28 | |
| dc.date.accessioned | 2026-07-07T08:12:41Z | |
| dc.date.available | 2026-07-07T08:12:41Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0706.4009 | |
| dc.identifier | http://arxiv.org/abs/0706.4009 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/132535 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.title | Multi-criteria scheduling of pipeline workflows | |
| dc.type | text |