## Computing the Expected Makespan of Task Graphs in the Presence of Silent Errors

- Henri Casanova, Julien Herrmann, Yves Robert
- 2016 45th International Conference on Parallel…
- 2016

Highly Influenced

@article{Canon2016CorrelationAwareHF, title={Correlation-Aware Heuristics for Evaluating the Distribution of the Longest Path Length of a DAG with Random Weights}, author={Louis-Claude Canon and Emmanuel Jeannot}, journal={IEEE Transactions on Parallel and Distributed Systems}, year={2016}, volume={27}, pages={3158-3171} }

- Published 2016 in IEEE Transactions on Parallel and Distributed…
DOI:10.1109/TPDS.2016.2528983

Coping with uncertainties when scheduling task graphs on parallel machines requires to perform non-trivial evaluations. When considering that each computation and communication duration is a random variable, evaluating the distribution of the critical path length of such graphs involves computing maximums and sums of possibly dependent random variables. The discrete version of this evaluation problem is known to be #P-hard. Here, we propose two heuristics, CorLCA and Cordyn, to compute such… CONTINUE READING