Abstract
This paper considers the problem of scheduling tasks on multiprocessors. Two tasks linked by a precedence constraint and executed by two different processors must communicate. The resulting delay depends on the tasks and on the processor network. 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. Algorithms computing separately the processor assignment and the sequencing on each processor are considered. We propose a partially on-line scheduling algorithm based on critical paths to cope with the possible disturbances. Some theoretical results and an experimental study show the interest of this approach compared with fully on-line scheduling.
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
Bampis E., Guinand F., Trystram D., Some Models for Scheduling Parallel Programs with Communication Delays, Discrete Applied Mathematics, 51, pp. 5–24, 1997.
Cheétienne Ph., Picouleau C., Scheduling with communication delays: a survey, in Scheduling Theory and its Applications, P. Chrétienne, E.G. Coffman, J.K. Lenstra, Z. Liu (Eds), John Wiley Ltd 1995.
Gerasoulis A., Yang T., A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors, J. of Parallel and Distributed Computing, 16, pp. 276–291, 1992.
Hanen C, Munier A, Performance of Coffman Graham schedule in the presence of unit communication delays, Discrete Applied Mathematics, 81, pp. 93–108, 1998.
Hwang J.J., Chow Y.C., Anger F.D., Lee C.Y., Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput., 18(2), pp.244–257, 1989.
Lenstra J.K., Veldhorst, M., Veltman B., The complexity of scheduling trees with communication delays, J. of Algorithms 20, pp. 157–173, 1996.
Moukrim A., Quilliot A., Scheduling with communication delays and data routing in Message Passing Architectures, LNCS, vol. 1388, pp. 438–451, 1998.
Papadimitriou C.H., Yannakakis M., Towards an Architecture-Independent Analysis of Parallel Algorithms, SIAM J. Comput., 19(2), pp. 322–328, 1990.
Rayward-Smith V.J., UET scheduling with interprocessor communication delays, Discrete Applied Mathematics, 18, pp. 55–71, 1986.
Sarkar V., Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, The MIT Press, 1989.
Sih G.C., Lee E.A., A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures, IEEE Trans. on Parallel and Distributed Systems, 4, pp. 279–301, 1993.
Yang T., Gerasoulis A., List scheduling with and without communication delay, Parallel Computing, 19, pp 1321–1344, 1993.
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
Moukrim, A., Sanlaville, E., Guinand, F. (1999). Scheduling with Communication Delays and On-Line Disturbances. 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_45
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_45
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