ALGORITHMS FOR SCHEDULING TASKS ON UNRELATED PROCESSORS

被引：90

作者：

DAVIS, E ^{[1
]}

JAFFE, JM ^{[1
]}

机构：

[1] MIT,CAMBRIDGE,MA 02139

来源：

JOURNAL OF THE ACM | 1981年 / 28卷 / 04期

关键词：

D O I：

10.1145/322276.322284

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：721 / 736

页数：16

共 13 条

[1]

[Anonymous], 1969, SIAM J APPL MATH

[2] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387

[3]

Bruno J.L., 1974, IFIPS C, V74, P504

[4]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[5] EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS [J].

HOROWITZ, E ;

SAHNI, S .

JOURNAL OF THE ACM, 1976, 23 (02) :317-327

[6] HEURISTIC ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON NONIDENTICAL PROCESSORS [J].

IBARRA, OH ;

KIM, CE .

JOURNAL OF THE ACM, 1977, 24 (02) :280-289

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

JAFFE, JM .

SIAM JOURNAL ON COMPUTING, 1980, 9 (03) :541-551

[8] EFFICIENT SCHEDULING OF TASKS WITHOUT FULL USE OF PROCESSOR RESOURCES [J].

JAFFE, JM .

THEORETICAL COMPUTER SCIENCE, 1980, 12 (01) :1-17

[9]

Kafura D. G., 1977, SIAM Journal on Computing, V6, P167, DOI 10.1137/0206014

[10] PREEMPTIVE SCHEDULING OF UNRELATED PARALLEL PROCESSORS BY LINEAR-PROGRAMMING [J].

LAWLER, EL ;

LABETOULLE, J .

JOURNAL OF THE ACM, 1978, 25 (04) :612-619

← 1 2 →