HEURISTIC ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON NONIDENTICAL PROCESSORS

被引：364

作者：

IBARRA, OH ^{[1
]}

KIM, CE ^{[1
]}

机构：

[1] UNIV MINNESOTA, DEPT COMP SCI, MINNEAPOLIS, MN 55455 USA

来源：

关键词：

D O I：

10.1145/322003.322011

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：280 / 289

页数：10

共 9 条

[1] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME
BRUNO, J
COFFMAN, EG
SETHI, R
[J]. COMMUNICATIONS OF THE ACM, 1974, 17 (07) : 382 - 387
[2] BRUNO J, INFORMATION PROCESSI, P504
[3] COFFMAN EG, 1976, MAR P INT S COMPTR P, P306
[4] Conway R, 1967, THEORY SCHEDULING
[5] GONZALEZ T, 1974, 751 U MINN COMPTR SC
[6] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES
GRAHAM, RL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) : 416 - &
[7] EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS
HOROWITZ, E
SAHNI, S
[J]. JOURNAL OF THE ACM, 1976, 23 (02) : 317 - 327
[8] Karp Richard M., 1972, COMPLEXITY COMPUTER, P85
[9] Sahni S., 1974, SIAM Journal on Computing, V3, P262, DOI 10.1137/0203021