Correlation-Aware Heuristics for Evaluating the Distribution of the Longest Path Length of a DAG with Random Weights

@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}
}
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

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 49 references

A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

  • T. Tobita, H. Kasahara
  • J. Scheduling, vol. 5, no. 5, pp. 379–394, 2002.
  • 2002
Highly Influential
3 Excerpts

2015, May). Emapse: Code and scripts [Online

  • L.-C. Canon
  • 2015

Similar Papers

Loading similar papers…