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. © Springer-Verlag Berlin Heidelberg 1999.
CITATION STYLE
Moukrim, A., Sanlaville, E., & Guinand, F. (1999). Scheduling with communication delays and on-line disturbances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 350–357). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_45
Mendeley helps you to discover research relevant for your work.