.png){kind=icon}
Return
TASK-SCHEDULING WITH INTERPROCESSOR COMMUNICATION DELAYS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90346-B.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Distributed memory architectures raise new and complex scheduling problems. In this paper, we first define a basic distributed memory computer scheduling problem issued from an ideal architecture. By proving that the corresponding decision problem is NP-complete, we show that unlike shared memory computer scheduling problems, these new problems do not become easy when the processor limitation constraint is removed. Finally, we improve the knowledge of the borderline between the easy and difficult subproblems of the basic one by giving some polynomial special cases.
Keywords:
SCHEDULING
COMPLEXITY
ALGORITHMS
INTERPROCESSOR COMMUNICATION DELAY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
.png){kind=icon}
