Scheduling multiprocessor tasks - a survey

被引：0
|
作者：
Blazewicz, J. [1 ]
Drozdowski, M. [1 ]
Weglarz, J. [1 ]
机构：
[1] Technical Univ of Poznan, Poznan, Poland
来源：
Microcomputer Applications | 1994年 / 13卷 / 02期
关键词：
Algorithms - Computational complexity - Computer program listings - Fault tolerant computer systems - Parallel processing systems - Program compilers - Response time (computer systems) - Scheduling - Surveys;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we survey the current problems that arise for the scheduling of multiprocessor tasks, i.e., those tasks that require the simultaneous use of more than one processor. The multiprocessor model seems to be natural for many applications exploiting their naturally inherited parallelism. This point of view, however, is different than the standard view in scheduling theory. Thus, multiprocessor tasks require a new look at the assumptions of the scheduling theory, and it requires new algorithms, as well.
引用
收藏
页码：89 / 97
相关论文
共 50 条
12345