.png){kind=icon}
返回
Scheduling multiprocessor tasks on parallel processors with limited availability
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00760-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this work we consider the problem of scheduling multiprocessor tasks on parallel processors available only in restricted intervals of time called time windows. The multiprocessor task model applies to modern production systems and parallel applications in which several processors can be utilized in parallel. Preemptable tasks are considered. Polynomial time algorithms are given in three cases: the case of maximum lateness criterion and a fixed number of processors, the case of schedule length criterion when tasks have various ready times and require either one or all processors. and in case of schedule length criterion when the sizes of the tasks are powers of 2. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
scheduling
parallel computing
multiprocessor tasks
parallel tasks
gang scheduling
co-scheduling
bandwidth allocation
time windows
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
A simple load balancing scheme for task allocation in parallel machines.png)
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91
OAAI
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91IF0
OAAI分享收藏
查看更多内容