A SHORTEST TREE ALGORITHM FOR OPTIMAL ASSIGNMENTS ACROSS SPACE AND TIME IN A DISTRIBUTED PROCESSOR SYSTEM

被引：112

作者：

BOKHARI, SH

机构：

来源：

关键词：

D O I：

10.1109/TSE.1981.226469

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：583 / 589

页数：7

共 8 条

[1] DUAL PROCESSOR SCHEDULING WITH DYNAMIC REASSIGNMENT [J].

BOKHARI, SH .

[2]

BOKHARI SH, UNPUBLISHED

[3]

GURSKY MJ, COMMUNICATION

[4]

MICHEL J, 1976, COMPUTER GRAPHICS, V10

[5]

Stone H. S., 1977, ECECS777 U MASS DEP

[6] MULTIPROCESSOR SCHEDULING WITH AID OF NETWORK FLOW ALGORITHMS [J].

STONE, HS .

[7] THE STRUCTURE OF MODULAR PROGRAMS [J].

TURNER, J .

[8]

VANDAM A, 1974, P IEEE, V62, P83