Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-27T10:57:02.941Z Has data issue: false hasContentIssue false
  • English
  • Français

Parallel Machine Scheduling with Uncertain Communication Delays

Published online by Cambridge University Press:  15 November 2003

Aziz Moukrim ,
Eric Sanlaville  and
Frédéric Guinand
Aziz Moukrim
Affiliation:
HeuDiaSyC, UMR 6599 du CNRS, Université de Technologie de Compiègne, Centre de Recherches de Royallieu, BP. 20529, 60205 Compiègne Cedex, France; [email protected].
Eric Sanlaville
Affiliation:
LIMOS, UMR 6158 du CNRS, Université de Clermont-Ferrand 2, Campus des Cézeaux, 63177 Aubière Cedex, France; [email protected].
Frédéric Guinand
Affiliation:
LIH, Université du Havre, 25 rue Philippe Lebon, BP. 5405, 76058 Le Havre Cedex, France; [email protected].
Get access

Abstract

This paper is concerned with scheduling when the data are not fully knownbefore the execution. In that case computing a complete schedule off-linewith estimated data may lead to poor performances. Some flexibility must beadded 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 stabilizationscheme. This is applied to the m machine problem with communicationdelays: 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 theoreticalresults for tree-like precedence constraints and an experimental study show the interest of this approach compared with fully on-line scheduling.

Keywords

Parallel computingscheduling withcommunicationdelaysdisturbances on communication delayslistschedulingflexibility.
Type
Research Article
Information
RAIRO - Operations Research , Volume 37 , Issue 1 , January 2003 , pp. 1 - 16
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bampis, E., Guinand, F. and Trystram, D., Some Models for Scheduling Parallel Programs with Communication Delays. Discrete Appl. Math. 51 (1997) 5-24. CrossRef
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. CrossRef
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).
Coffman Jr, E.G.. and R.L. Graham, Optimal scheduling for two-processor systems. Acta Informatica 1 (1972) 200-213. CrossRef
Djordjevic, G.L. and Tosic, M.B., A heuristic for scheduling task graphs with communication delays onto multiprocessors. Parallel Comput. 22 (1996) 1197-1214. CrossRef
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. CrossRef
Gerasoulis, A. and Yang, T., Comparison, A of Clustering Heuristics for Scheduling DAGs on Multiprocessors. J. Parallel Distributed Comput. 16 (1992) 276-291. CrossRef
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).
Guinand, F. and Trystram, D., Optimal scheduling of UECT trees on two processors. RAIRO: Oper. Res. 34 (2000) 131-144. CrossRef
Hanen, C. and Munier, A., Performance of Coffman Graham schedule in the presence of unit communication delays. Discrete Appl. Math. 81 (1998) 93-108. CrossRef
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. CrossRef
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. CrossRef
P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications. Kluwer Academic Publisher (1997).
Lenstra, J.K., Veldhorst, M. and Veltman, B., The complexity of scheduling trees with communication delays. J. Algorithms 20 (1996) 157-173. CrossRef
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.
Papadimitriou, C.H. and Yannakakis, M., Towards an Architecture-Independent Analysis of Parallel Algorithms. SIAM J. Comput. 19 (1990) 322-328. CrossRef
Rayward-Smith, V.J., UET scheduling with interprocessor communication delays. Discrete Appl. Math. 18 (1986) 55-71. CrossRef
V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. The MIT Press (1989).
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.
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. CrossRef
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. CrossRef
Yang, T. and Gerasoulis, A., List scheduling with and without communication delay. Parallel Comput. 19 (1993) 1321-1344. CrossRef