Abstract
We propose a tw o-step algorithm that efficiently constructs a schedule of minimum makespan for the precedence multiprocessor constrained scheduling problem in the presence of hierarchical communications and task duplication for UET-UCT graphs.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Bampis, R. Giroudeau, and J.C. König. A heuristic for the precedence constrained multiprocessor scheduling problem with hierarchical communications. Technical Report 35, Université d’Evry Val d’Essonne, 1999.
E. Bampis, R. Giroudeau, and J.C. König. On the hardness of approximationg the precedence constrained multiprocessor scheduling problem with hierarchical communications. Technical Report 34, Université d’Evry Val d’Essonne, 1999.
E. Bampis, R. Giroudeau, and J.C. König. Using duplication for the precedence constrained multiprocessor scheduling problem with hierarchical communications. Technical Report 36, Université d’Evry Val d’Essonne, 1999.
P. Chrétienne and J.Y. Colin. C.P.M. scheduling with small interprocessor communication delays. Operations Research, 39(3), 1991.
P. Chrétienne, E.J. Coffman Jr, J.K. Lenstra, and Z. Liu. Scheduling Theory and its Applications. Wiley, 1995.
R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in determinics sequencing and scheduling theory:a survey. Ann. Discrete Math., 5:287–326, 1979.
A. Munier and C. Hanen. Using duplication for scheduling unitary tasks on m processors with communication delays. Theoretical Computer Science, 178: 119–127, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Giroudeau, R., König, JC. (1999). Using duplication for the multiprocessor scheduling problem with hierarchical communications. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_47
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive