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, V. Rehn-sonigo, and Y. Robert, Optimizing latency and reliability of pipeline workflow applications, 2008 IEEE International Symposium on Parallel and Distributed Processing, 2008.
DOI : 10.1109/IPDPS.2008.4536160

URL : https://hal.archives-ouvertes.fr/hal-00803486

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

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

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

D. Project, Middleware for Filtering Large Archival Scientific Datasets in a Grid Environment

R. Dechter and J. Pearl, Generalized best-first search strategies and the optimality af A*, Journal of the ACM, vol.32, issue.3, pp.505-536, 1985.
DOI : 10.1145/3828.3830

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

A. Girault, H. Kalla, M. Sighireanu, and Y. Sorel, An algorithm for automatically obtaining distributed and fault-tolerant static schedules, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings., 2003.
DOI : 10.1109/DSN.2003.1209927

URL : https://hal.archives-ouvertes.fr/hal-00110453

S. L. Hary and F. Ozguner, Precedence-constrained task allocation onto point-to-point networks for pipelined execution, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.8, pp.838-851, 1999.
DOI : 10.1109/71.790601

K. Hashimito, T. Tsuchiya, and T. Kikuno, Effective Scheduling of Duplicated Tasks for Fault-Tolerance in Multiprocessor Systems, IEICE Transactions on Information and Systems, issue.3, pp.85-525, 2002.

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

S. J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 2003.

A. Z. Shahul and O. Sinnen, Optimal Scheduling of Task Graphs on Parallel Systems, 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
DOI : 10.1109/PDCAT.2008.54

B. A. Shirazi, A. R. Hurson, and K. M. Kavi, Scheduling and load balancing in parallel and distributed systems, 1995.

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, PPoPP'95, pp.134-143, 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, pp.62-71, 1996.
DOI : 10.1145/237502.237508

K. Taura and A. A. Chien, A heuristic algorithm for mapping communicating tasks on heterogeneous resources, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556), pp.102-115, 2000.
DOI : 10.1109/HCW.2000.843736

Q. Wu, J. Gao, M. Zhu, N. Rao, J. Huang et al., Self-Adaptive Configuration of Visualization Pipeline Over Wide-Area Networks, IEEE Transactions on Computers, vol.57, issue.1, pp.55-68, 2008.
DOI : 10.1109/TC.2007.70777

Q. Wu and Y. Gu, Supporting Distributed Application Workflows in Heterogeneous Computing Environments, 2008 14th IEEE International Conference on Parallel and Distributed Systems, 2008.
DOI : 10.1109/ICPADS.2008.40