Abstract
We consider the problem of scheduling UET-UCT task graphs on a ring network of m processors, in order to minimize the makespan. We show that no polynomial-time algorithm with relative performance better than 4/3 can exist in that case (unless P=NP), and prove that the relative performance g of the general list scheduling algorithm proposed by Rayward-Smith is such that [√m]≤g ≲-1 + 3/8m −1/2m, for m even.
Chapter PDF
References
Chrétienne, P., Picouleau, C.: Scheduling with Communication Delays: A Survey. In Chrétienne, P., Coffman, E. G., Jr., Lenstra, J. K., Liu, Z., editors, Scheduling Theory and its Applications, John Wiley & Sons, Chichester. (1995)
Coffman, E. G., Jr.: editor, Computer and Job-Shop Scheduling Theory. Wiley, New-York. (1976)
Garey, M. R., Johnson, D. S.: Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Fransisco. (1979)
Hanen, C., Munier, A.: An approximation algorithm for scheduling unitary tasks on m processors with communication delays. Technical Report 95-12, LITP, Institut Blaise Pascal, Université Paris VI, Paris. (1995)
Hoogeven, J. A., Lenstra, J. K., Veltman, B.: Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Letters. 16 (1994) 129–137
Lee, C. Y., Hwang, J. J., Chow, Y. C., Anger, F. D.: Multiprocessor scheduling with Interprocessor Delays. Oper. Res. Letters. 7 (1988) 141–147
Liu, Z.: A note on Graham's Bound. Information Processing Letters. 36 (1990) 1–5
Picouleau, C.: UET-UCT Schedules on arbitrary networks. Technical Report 94-08, LITP, Institut Blaise Pascal, Université Paris VI, Paris. (1994)
Picouleau, C.: Etudes de problèmes d'optimisation dans les systèmes distibués. PhD Thesis, Université Paris VI, France. (1992)
Rayward-Smith, V. J.: UET Scheduling with interprocessor communication delays. Discr. Appl. Maths. 18 (1987) 51–71
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lahlou, C. (1996). Scheduling with unit processing and communication times on a ring network: Approximation results. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024746
Download citation
DOI: https://doi.org/10.1007/BFb0024746
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive