Pegasus, a workflow management system for science automation, Future Generation Computer Systems, vol.46, issue.0, pp.17-35, 2015. ,
DOI : 10.1016/j.future.2014.10.008
ASKALON: A Development and Grid Computing Environment for Scientific Workflows, Workflows for e-Science, pp.450-471, 2007. ,
DOI : 10.1007/978-1-84628-757-2_27
Swift: A language for distributed parallel scripting, Parallel Computing, vol.37, issue.9, pp.633-652, 2011. ,
DOI : 10.1016/j.parco.2011.05.005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.4929
The Taverna workflow suite: designing and executing workflows of Web Services on the desktop, web or in the cloud, Nucleic Acids Research, vol.41, issue.W1, p.328, 2013. ,
DOI : 10.1093/nar/gkt328
Kepler: an extensible system for design and execution of scientific workflows, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004., pp.423-424, 2004. ,
DOI : 10.1109/SSDM.2004.1311241
Makeflow, Proceedings of the 1st ACM SIGMOD Workshop on Scalable Workflow Execution Engines and Technologies, SWEET '12, p.1, 2012. ,
DOI : 10.1145/2443416.2443417
Enabling In-situ Execution of Coupled Scientific Workflow on Multi-core Platform, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.1352-1363, 2012. ,
DOI : 10.1109/IPDPS.2012.122
Computational complexity of PERT problems, Networks, vol.8, issue.2, pp.139-147, 1988. ,
DOI : 10.1002/net.3230180206
Scheduling: Theory, Algorithms, and Systems, 2016. ,
The Complexity of Enumeration and Reliability Problems, SIAM Journal on Computing, vol.8, issue.3, pp.410-421, 1979. ,
DOI : 10.1137/0208032
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected, SIAM Journal on Computing, vol.12, issue.4, pp.777-788, 1983. ,
DOI : 10.1137/0212053
A note on the complexity of network reliability problems, IEEE Trans. Inf. Theory, vol.47, pp.1971-1988, 2004. ,
The recognition of series parallel digraphs, Proc. 11th ACM Symp. Theory of Computing, ser. STOC '79, pp.1-12, 1979. ,
Parallel algorithms for series parallel graphs, pp.277-289, 1996. ,
DOI : 10.1007/3-540-61680-2_62
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5135
On the Optimum Checkpoint Selection Problem, SIAM Journal on Computing, vol.13, issue.3, 1984. ,
DOI : 10.1137/0213039
Pegasus workflow generator, 2014. ,
Scheduling under Uncertainty: Bounding the Makespan Distribution, Computational Discrete Mathematics: Advanced Lectures, pp.79-97, 2001. ,
DOI : 10.1007/3-540-45506-X_7
Correlation-Aware Heuristics for Evaluating the Distribution of the Longest Path Length of a DAG with Random Weights, IEEE Transactions on Parallel and Distributed Systems, vol.27, issue.11, 2016. ,
DOI : 10.1109/TPDS.2016.2528983
URL : https://hal.archives-ouvertes.fr/hal-01412922
Probability and Computing: Randomized Algorithms and Probabilistic Analysis, 2005. ,
DOI : 10.1017/CBO9780511813603
Letter to the Editor???Monte Carlo Methods and the PERT Problem, Operations Research, vol.11, issue.5, pp.839-860, 1963. ,
DOI : 10.1287/opre.11.5.839
The Completion Time of PERT Networks, Journal of the Operational Research Society, vol.34, issue.2, pp.155-158, 1983. ,
DOI : 10.1057/jors.1983.27
Computing the expected makespan of task graphs in the presence of silent errors Workshop on Programming Models and Systems Software for High-End Computing A mapping algorithm for parallel sparse cholesky factorization, P2S2'2016, the 9th Int, pp.1253-1257, 1993. ,
Checkpointing workflows for fail-stop errors, INRIA, Research Report, vol.9068, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01525378
Community Resources for Enabling Research in Distributed Scientific Workflows, 2014 IEEE 10th International Conference on e-Science, pp.177-184, 2014. ,
DOI : 10.1109/eScience.2014.44
Characterization of scientific workflows, 2008 Third Workshop on Workflows in Support of Large-Scale Science, pp.1-10, 2008. ,
DOI : 10.1109/WORKS.2008.4723958
Characterizing and profiling scientific workflows, Future Generation Computer Systems, vol.29, issue.3, pp.682-692, 2013. ,
DOI : 10.1016/j.future.2012.08.015
Checkpointing Workflows for Fail-Stop Errors: Simulation Code, 2017. ,
On the Optimum Checkpoint Selection Problem, SIAM Journal on Computing, vol.13, issue.3, pp.630-649, 1984. ,
DOI : 10.1137/0213039
Assessing generalpurpose algorithms to cope with fail-stop and silent errors, ACM Trans. Parallel Computing, vol.3, issue.2, 2016. ,
DOI : 10.1007/978-3-319-17248-4_11
URL : https://hal.archives-ouvertes.fr/hal-01066664
Scheduling Computational Workflows on Failure-Prone Platforms, 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, pp.2-26, 2016. ,
DOI : 10.1109/IPDPSW.2015.33
URL : https://hal.archives-ouvertes.fr/hal-01075100
A survey of graph layout problems, ACM Computing Surveys, vol.34, issue.3, pp.313-356, 2002. ,
DOI : 10.1145/568522.568523