Skip to main content Accessibility help

Parallel Machine Scheduling with Uncertain Communication Delays

  • Aziz Moukrim (a1), Eric Sanlaville (a2) and Frédéric Guinand (a3)


This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our model an estimation of the delay is known at compile time; but disturbances due to network contention, link failures, ... may occur at execution time. Hence the processor assignment and a partial sequencing on each processor are determined off-line. Some theoretical results for tree-like precedence constraints and an experimental study show the interest of this approach compared with fully on-line scheduling.



Hide All
[1] Bampis, E., Guinand, F. and Trystram, D., Some Models for Scheduling Parallel Programs with Communication Delays. Discrete Appl. Math. 51 (1997) 5-24.
[2] Ph. Chrétienne, A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. EJOR 43 (1989) 225-230.
[3] Ph. Chrétienne and C. Picouleau, Scheduling with communication delays: a survey, in Scheduling Theory and its Applications, edited by Ph. Chrétienne, E.G. Coffman, J.K. Lenstra and Z. Liu. John Wiley Ltd. (1995).
[4] Coffman Jr, E.G.. and R.L. Graham, Optimal scheduling for two-processor systems. Acta Informatica 1 (1972) 200-213.
[5] Djordjevic, G.L. and Tosic, M.B., A heuristic for scheduling task graphs with communication delays onto multiprocessors. Parallel Comput. 22 (1996) 1197-1214.
[6] Galambos, G. and Woeginger, G.J., An on-line scheduling heuristic with better worst case ratio than Graham list scheduling. SIAM J. Comput. 22 (1993) 349-355.
[7] Gerasoulis, A. and Yang, T., Comparison, A of Clustering Heuristics for Scheduling DAGs on Multiprocessors. J. Parallel Distributed Comput. 16 (1992) 276-291.
[8] A. Gerasoulis and T. Yang, Application of graph scheduling techniques in parallelizing irregular scientific computation, in Parallel Algorithms for Irregular Problems: State of the Art, edited by A. Ferreira and J. Rolim. Kluwer Academic Publishers, The Netherlands (1995).
[9] Guinand, F. and Trystram, D., Optimal scheduling of UECT trees on two processors. RAIRO: Oper. Res. 34 (2000) 131-144.
[10] Hanen, C. and Munier, A., Performance of Coffman Graham schedule in the presence of unit communication delays. Discrete Appl. Math. 81 (1998) 93-108.
[11] Hwang, J.J., Chow, Y.C., Anger, F.D. and Lee, C.Y., Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18 (1989) 244-257.
[12] Kolen, A.W.J., Rinnooy Kan, A.H.G., Van Hoesel, C.P.M. and Wagelmans, A.P.M., Sensitivity analysis of list scheduling heuristics. Discrete Appl. Math. 55 (1994) 145-162.
[13] P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications. Kluwer Academic Publisher (1997).
[14] Lenstra, J.K., Veldhorst, M. and Veltman, B., The complexity of scheduling trees with communication delays. J. Algorithms 20 (1996) 157-173.
[15] A. Moukrim and A. Quilliot, Scheduling with communication delays and data routing in Message Passing Architectures. Springer, Lecture Notes in Comput. Sci. 1388 (1998) 438-451.
[16] Papadimitriou, C.H. and Yannakakis, M., Towards an Architecture-Independent Analysis of Parallel Algorithms. SIAM J. Comput. 19 (1990) 322-328.
[17] Rayward-Smith, V.J., UET scheduling with interprocessor communication delays. Discrete Appl. Math. 18 (1986) 55-71.
[18] V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. The MIT Press (1989).
[19] Sih, G.C. and Lee, E.A., A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel Distributed Systems 4 (1993) 279-301.
[20] Sotskov, Y.N., Wagelmans, A.P.M. and Werner, F., On the calculation of stability radius of an optimal or an approximate schedule. Ann. O.R. 83 (1998) 213-252.
[21] Wu, S.D., Byeon, E. and Storer, R.H., A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Oper. Res. 47 (1999) 113-124.
[22] Yang, T. and Gerasoulis, A., List scheduling with and without communication delay. Parallel Comput. 19 (1993) 1321-1344.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

RAIRO - Operations Research
  • ISSN: 0399-0559
  • EISSN: 1290-3868
  • URL: /core/journals/rairo-operations-research
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed