\documentclass{article}
\begin{document}
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,
latency, reliability (or a combination). Typical applications include
digital image processing, where images are processed in steady-state
mode. In this talk, we study the complexity of various multi-criteria
mapping problems for pipeline graphs. For some NP-hard instances of
the problem, polynomial bi-criteria heuristics are presented and their
relative performance is evaluated through extensive simulations.
\end{document}