PREEMPTIVE SCHEDULING OF MULTIPROCESSOR TASKS ON THE DEDICATED PROCESSOR SYSTEM SUBJECT TO MINIMAL LATENESS

被引:13
作者
BIANCO, L
BLAZEWICZ, J
DELLOLMO, P
DROZDOWSKI, M
机构
[1] POLITECH POZNANSKIEJ,INST INFORMAT,PIOTROWO 3A,PL-60095 POZNAN,POLAND
[2] CNR,IST ANALISI SISTEMI & INFORMAT,ROME,ITALY
关键词
PARALLEL PROCESSING; SCHEDULING; POLYNOMIAL TIME ALGORITHMS;
D O I
10.1016/0020-0190(93)90054-D
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:109 / 113
页数:5
相关论文
共 15 条
  • [1] Baker K., 1974, INTRO SEQUENCING SCH
  • [2] BIANCO L, UNPUB SCHEDULING PRE
  • [3] SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY
    BLAZEWICZ, J
    LENSTRA, JK
    KAN, AHGR
    [J]. DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 11 - 24
  • [4] BLAZEWICZ J, 1992, INFORM PROCESS LETT, V41, P275, DOI 10.1016/0020-0190(92)90172-R
  • [5] BLAZEWICZ J, 1986, IEEE T COMPUT, V35, P389
  • [6] Blazewicz J, 1992, SCHEDULING COMPUTER
  • [7] Coffman E.G., 1976, COMPUTER JOB SHOP SC
  • [8] Du J., 1989, SIAM J DISCRETE MATH, V2, P473, DOI DOI 10.1137/0402042
  • [9] Graham R. L., 1979, Discrete Optimisation, P287
  • [10] KRAWCZYK H, 1985, IEEE T COMPUT, V34, P869, DOI 10.1109/TC.1985.1676647