Task scheduling with interprocessor communication delays

Task scheduling with interprocessor communication delays

0.00 Avg rating0 Votes
Article ID: iaor19942205
Country: Netherlands
Volume: 57
Issue: 3
Start Page Number: 348
End Page Number: 354
Publication Date: Mar 1992
Journal: European Journal of Operational Research
Authors:
Abstract:

Distributed memory architectures raise new and complex scheduling problems. This paper first defines a basic distributed memory computer scheduling problem issued from an ideal architecture. By proving that the corresponding decision problem is NP-complete, it shows that unlike shared memory computer scheduling problems, these new problems do not become easy when the processor limitation constraint is removed. Finally, the knowledge of the borderline between the easy and difficult subproblems of the basic one is improved by giving some polynomial special cases.

Reviews

Required fields are marked *. Your email address will not be published.