|
|||||
|
|
Multiprocessor scheduling with communication delays |
|
| Authors: | B. Veltman B. J. Lageweg J. K. Lenstra |
| Affiliation: | Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands a Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands b Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands |
| Abstract: | This paper adresses certain types of scheduling problems that arise when a parallel computation is to be executed on a multiprocessor. We define a model that allows for communication delays between precedence-related tasks, and propose a classification of various submodels. We also review complexity results and optimization and approximation algorithms that have been presented in the literature. |
| Keywords: | Scheduling Parallel processors Communication delays Algorithms Complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |