Scheduling divisible jobs on hypercubes

被引：47

作者：

Blazewicz, J

Drozdowski, M

机构：

[1] Institute of Computing Science, Poznań University of Technology, 60-965 Poznań

来源：

PARALLEL COMPUTING | 1995年 / 21卷 / 12期

关键词：

parallel processing; deterministic scheduling; performance analysis; hypercube;

D O I：

10.1016/0167-8191(95)00046-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this work a problem of finding an optimal distribution of a divisible computational job among a set of processors is considered. In the model of parallel computer systems two important factors must be taken into account: speeds of processors and speeds of communications links. With regard to this, we propose a deterministic approach finding an optimal distribution of the job's load on a hypercube of processors. The method used allows also the determination of performance bounds on the hypercube architecture.

引用

页码：1945 / 1956

页数：12

共 19 条

[1] BUS-ORIENTED LOAD SHARING FOR A NETWORK OF SENSOR DRIVEN PROCESSORS [J].