EFFICIENT SCHEDULING OF TASKS WITHOUT FULL USE OF PROCESSOR RESOURCES

被引：19

作者：

JAFFE, JM ^{[1
]}

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1016/0304-3975(80)90002-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 17

页数：17

共 13 条

[1] [Anonymous], 1969, SIAM J APPL MATH
[2] CHO Y, 1978, TR7813 U MINN
[3] DAVIS EM, UNPUBLISHED
[4] Gonzalez T., 1977, SIAM Journal on Computing, V6, P155, DOI 10.1137/0206013
[5] EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS
HOROWITZ, E
SAHNI, S
[J]. JOURNAL OF THE ACM, 1976, 23 (02) : 317 - 327
[6] LEVEL ALGORITHM FOR PREEMPTIVE SCHEDULING
HORVATH, EC
LAM, S
SETHI, R
[J]. JOURNAL OF THE ACM, 1977, 24 (01) : 32 - 43
[7] JAFFE J, UNPUBLISHED
[8] JAFFE JM, 1979, MIT122 LAB COMP SCI
[9] LIU JWS, 1978, ACTA INFORM, V10, P95, DOI 10.1007/BF00260927
[10] LIU JWS, 1974, INFORM PROCESSING, V74, P349