TIGHTER BOUNDS FOR LPT SCHEDULING ON UNIFORM PROCESSORS

被引：59

作者：

FRIESEN, DK

机构：

来源：

关键词：

D O I：

10.1137/0216037

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：554 / 560

页数：7

共 10 条

[1] BOUNDS FOR LIST SCHEDULES ON UNIFORM PROCESSORS [J].

CHO, Y ;

SAHNI, S .

[2]

COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001

[3] SCHEDULING INDEPENDENT TASKS ON UNIFORM PROCESSORS [J].

DOBSON, G .

[4] BOUNDS FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS [J].

FRIESEN, DK ;

LANGSTON, MA .

[5]

Garey MR., 1979, COMPUTERS INTRACTABI

[6]

Gonzalez T., 1977, SIAM Journal on Computing, V6, P155, DOI 10.1137/0206013

[7] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].

GRAHAM, RL .

HOROWITZ, E ;

SAHNI, S .

[9]

Liu J. W. S., 1975, Bounds on scheduling algorithms for heterogeneous computing systems

[10]

Ullman J.D., 1976, COMPUTER JOB SHOP SC