HEURISTIC ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON NONIDENTICAL PROCESSORS

被引：367

作者：

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 [J].

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

[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 [J].

GRAHAM, RL .

HOROWITZ, E ;

SAHNI, S .

[8]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[9]

Sahni S., 1974, SIAM Journal on Computing, V3, P262, DOI 10.1137/0203021