B. Awerbuch, Y. Azar, A. Fiat, and F. Leighton, Making commitments in the face of uncertainty, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.519-530, 1996.
DOI : 10.1145/237814.238000

A. Benoit, L. Marchal, Y. Robert, O. Sinnen, and L. Lyon, Mapping Pipelined Applications with Replication to Increase Throughput and Reliability, 2010 22nd International Symposium on Computer Architecture and High Performance Computing, 2009.
DOI : 10.1109/SBAC-PAD.2010.16
URL : https://hal.archives-ouvertes.fr/hal-01059633

A. Benoit and Y. Robert, Mapping pipeline skeletons onto heterogeneous platforms, Journal of Parallel and Distributed Computing, vol.68, issue.6, pp.790-808, 2008.
DOI : 10.1016/j.jpdc.2007.11.004
URL : https://hal.archives-ouvertes.fr/hal-00118921

A. Benoit and Y. Robert, Complexity results for throughput and latency optimization of replicated and data-parallel workflows. Algorithmica, pp.453-461, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00803515

S. Bhatt, F. Chung, F. Leighton, and A. Rosenberg, On optimal strategies for cycle-stealing in networks of workstations, IEEE Transactions on Computers, vol.46, issue.5, pp.545-557, 1997.
DOI : 10.1109/12.589220

M. Cole, Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming, Parallel Computing, vol.30, issue.3, pp.389-406, 2004.
DOI : 10.1016/j.parco.2003.12.002

M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979.

B. Hong and V. Prasanna, Bandwidth-aware resource allocation for heterogeneous computing systems to maximize throughput, Proceedings of the 32th International Conference on Parallel Processing, 2003.

N. Karonis, B. Toonen, and I. Foster, MPICH-G2: A Grid-enabled implementation of the Message Passing Interface, Journal of Parallel and Distributed Computing, vol.63, issue.5, pp.551-563, 2003.
DOI : 10.1016/S0743-7315(03)00002-9

F. Rabhi and S. Gorlatch, Patterns and Skeletons for Parallel and Distributed Computing, 2002.
DOI : 10.1007/978-1-4471-0097-3

A. Rosenberg, Optimal schedules for cycle-stealing in a network of workstations with a bag-of-tasks workload, IEEE Transactions on Parallel and Distributed Systems, vol.13, issue.2, pp.179-191, 2002.
DOI : 10.1109/71.983945

J. Subhlok and G. Vondran, Optimal mapping of sequences of data parallel tasks, Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1995.

J. Subhlok and G. Vondran, Optimal latency-throughput tradeoffs for data parallel pipelines, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures , SPAA '96, 1996.
DOI : 10.1145/237502.237508

G. Tel, Introduction to Distributed Algorithms, 2000.
DOI : 10.1017/CBO9781139168724