ON THE COMPLEXITY OF SCHEDULING PROBLEMS FOR PARALLEL PIPELINED MACHINES

被引：36

作者：

BERNSTEIN, D

RODEH, M

GERTNER, I

机构：

[1] TECHNION INST,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL

[2] IBM ISRAEL LTD,ISRAEL SCI CTR,HAIFA RES GRP,DEPT SOFTWARE SYST & ALGORITHMS,IL-32000 HAIFA,ISRAEL

来源：

关键词：

D O I：

10.1109/12.29469

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：1308 / 1313

页数：6

共 17 条

[11]

Hwang K., 1984, COMPUTER ARCHITECTUR

[12] BOUNDS ON THE SCHEDULING OF TYPED TASK SYSTEMS [J].

JAFFE, JM .

[13]

KOGGE PM, 1983, ARCHITECTURE PIPELIN

[14]

LI HF, 1977, IEEE T COMPUT, V26, P1101, DOI 10.1109/TC.1977.1674756

[15]

LLOYD EL, 1980, MITLCSTR236

[16] SEQUENCING TO MINIMIZE THE MAXIMUM JOB COST [J].

MONMA, CL .

[17] CRAY-1 COMPUTER SYSTEM [J].

RUSSELL, RM .