Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-10T21:46:54.213Z Has data issue: false hasContentIssue false
  • English
  • Français

Scheduling in the presence of processor networks : complexityand approximation

Published online by Cambridge University Press:  04 May 2012

Vincent Boudet ,
Johanne Cohen ,
Rodolphe Giroudeau  and
Jean-Claude König
Vincent Boudet
Affiliation:
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, UMR 5055, France. boudet@lirmm.fr; rgirou@lirmm.fr; konig@lirmm.fr
Johanne Cohen
Affiliation:
LORIA, 54506 Vandoeuvre-lès-Nancy Cedex, France; Johanne.Cohen@loria.fr
Rodolphe Giroudeau
Affiliation:
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, UMR 5055, France. boudet@lirmm.fr; rgirou@lirmm.fr; konig@lirmm.fr
Jean-Claude König
Affiliation:
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, UMR 5055, France. boudet@lirmm.fr; rgirou@lirmm.fr; konig@lirmm.fr
Get access

Abstract

In this paper, we study the problem of makespan minimization for the multiprocessorscheduling problem in the presence of communication delays. The communication delaybetween two tasks i and j depends on the distancebetween the two processors on which these two tasks are executed. Lahlou shows that asimple polynomial-time algorithm exists when the length of the schedule is at most two(the problem becomes 𝒩𝒫-complete when the length of the scheduleis at most three). We prove that there is no polynomial-time algorithm with a performanceguarantee of less than 4/3 (unless 𝒫 = 𝒩𝒫) to minimizethe makespan when the network topology is a chain or ring and the precedence graph is abipartite graph of depth one. We also develop two polynomial-time approximation algorithmswith constant ratio dedicated to cases where the processor network admits a limited orunlimited number of processors.

Keywords

Schedulingnon-approximabilityprocessor network model
Type
Research Article
Information
RAIRO - Operations Research , Volume 46 , Issue 1 , January 2012 , pp. 1 - 22
Copyright
© EDP Sciences, ROADEF, SMAI, 2012

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

J. Błażewicz, K. Ecker, E. Pesch, G. Schmidt and J. Wȩglarz, Handbook on Scheduling. Springer (2007).
Bampis, E., Giannakos, A. and König, J.C., On the complexity of scheduling with large communication delays. Eur. J. Oper. Res. 94 (1996) 252–260. Google Scholar
Bellman, R.E., On a routing problem. Quart. Appl. Math. 16 (1958) 87–90. Google Scholar
B. Chen, C.N. Potts and G.J. Woeginger, Handbook of Combinatorial Optimization, in A review of machine scheduling : Complexity, algorithms and approximability 3. Kluwer Academic Publishers (1998).
P. Chrétienne and C. Picouleau, Scheduling Theory and its Applications, in Scheduling with Communication Delays : A Survey. Chapt. 4, John Wiley & Sons (1995).
K.H. Ecker and H. Hodam, Heuristic algorithms for the task scheduling under consideration of communication delays. Technical Report, T.U. Clausthal (1996).
El-Rewini, H. and Lewis, T.G., Scheduling parallel program tasks onto arbitrary target machines. J. Parallel Distribut. Comput. 9 (1990) 138–153. Google Scholar
Finta, L. and Liu, Z., Complexity of task graph scheduling with fixed communication capacity. Int. J. Found. Comput. Sci. 8 (1997) 43–66. Google Scholar
M.R. Garey and D.S. Johnson, Computers and Intractability, a Guide to the Theory of 𝒩𝒫-Completeness. Freeman (1979).
A. Giannakos, Algorithmique pour le parallélisme : certains problèmes d’ordonnancement de tâches et algorithmes de couplage. Ph.D. thesis, Université de Paris-XI Orsay (1997).
Giroudeau, R., König, J.C. and Valéry, B., Scheduling UET-tasks on a star network : complexity and approximation. Quart. J. Oper. Res. 9 (2011) 29–48. Google Scholar
Graham, R.L., Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45 (1966) 1563–1581. Google Scholar
R.L. Graham, Bounds on the performance of scheduling algorithms, Computer and job-shop scheduling theory. E.G. Coffman edition, John Wiley Ltd. (1976).
Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling theory : a survey. Ann. Discrete Math. 5 (1979) 287–326. Google Scholar
Hoogeveen, J.A., Lenstra, J.K. and Veltman, B., Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16 (1994) 129–137. Google Scholar
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. Google Scholar
C. Lahlou, Scheduling with unit processing and communication times on a ring network : Approximation results, in Proceedings of Europar. Springer-Verlag (1996) 539–542.
C. Lahlou, Ordonnancement dans les réseaux de processeurs : complexité et approximation. Ph.D. thesis, Université Paris VI (1998).
A. Munier and J.C. König, A heuristic for a scheduling problem with communication delays. Oper. Res. (1997) 145–148.
C. Picouleau, UET − UCT schedules on arbitrary networks. Technical Report, LITP, Blaise Pascal, Université Paris VI (1994).
Picouleau, C., New complexity results on scheduling with small communication delays. Disc. Appl. Math. 60 (1995) 331–342. Google Scholar
Rayward-Smith, V.J., UET scheduling with unit interprocessor communication delays. Disc. Appl. Math. 18 (1987) 55–71. Google Scholar
O. Sinnen, Task Scheduling for Parallel System. Chap. 7, Wiley (2007).