Sensitivity analysis of tree scheduling on two machines with communication delays

@article{Guinand2004SensitivityAO,
  title={Sensitivity analysis of tree scheduling on two machines with communication delays},
  author={Fr{\'e}d{\'e}ric Guinand and Aziz Moukrim and Eric Sanlaville},
  journal={Parallel Computing},
  year={2004},
  volume={30},
  pages={103-120}
}
This paper presents a sensitivity analysis for the problem of scheduling trees with communication delays on two identical processors, to minimize the makespan. Tasks are supposed to have unit execution time (UET), and the values associated to communication delays are supposed unknown before the execution. The paper compares the optimal makespans with and without communication delays. The results are used to obtain sensitivity bounds for algorithms providing optimal schedules for graphs with… CONTINUE READING

From This Paper

Topics from this paper.
7 Citations
26 References
Similar Papers

References

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

Optimal scheduling of UECT trees on two processors

  • F. Guinand, D. Trystram
  • RAIRO Operation Research 34
  • 2000
Highly Influential
4 Excerpts

S

  • D. Arnold, S. Agrawal, +5 authors Z. Shi
  • Vadhiyar, User’s guide to Netsolve v 1.4.1…
  • 2002
1 Excerpt

Sensitivity Analysis of Tree-Scheduling Algorithms

  • F. Guinand, A. Moukrim, E. Sanlaville
  • Technical Report 2002, Universit e de…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…