The on-line multiprocessor scheduling problem with known sum of the tasks

被引：22
|
作者：
Angelelli, E
Nagy, AB
Speranza, MG
Tuza, Z
机构：
[1] Univ Brescia, Dept Quantitat Methods, I-25122 Brescia, Italy
[2] Univ Veszprem, Dept Comp Sci, Veszprem, Hungary
[3] Hungarian Acad Sci, Inst Comp & Automat, Budapest, Hungary
来源：
JOURNAL OF SCHEDULING | 2004年 / 7卷 / 06期
基金：
匈牙利科学研究基金会;
关键词：
on-line scheduling; parallel processors; competitive analysis;
D O I：
10.1023/B:JOSH.0000046074.03560.5d
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper we investigate a semi on-line multiprocessor scheduling problem. The problem is the classical on-line multiprocessor problem where the total sum of the tasks is known in advance. We show an asymptotic lower bound on the performance ratio of any algorithm (as the number of processors gets large), and present an algorithm which has performance ratio at most root6+1/2<1.725 for any number of processors. When compared with known general lower bounds, this result indicates that the information on the sum of tasks substantially improves the performance ratio of on-line algorithms.
引用
收藏
页码：421 / 428
页数：8
相关论文
共 50 条
  • [41] Scheduling for on-line taxi problem on a real line and competitive algorithms
    Xin, CL
    Ma, WM
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 3078 - 3083
  • [42] MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
    Koren, Gilad, 1600, (128): : 1 - 2
  • [43] On parallelizing the multiprocessor scheduling problem
    Ahmad, I
    Kwok, YK
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (04) : 414 - 432
  • [44] Artificial neural network for multiprocessor tasks scheduling
    Czarnowski, I
    Jedrzejowicz, P
    INTELLIGENT INFORMATION SYSTEMS, 2000, : 207 - 216
  • [45] A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks
    Wang, Ling
    Xu, Ye
    Zhou, Gang
    Wang, Shengyao
    Liu, Min
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 59 (9-12): : 1113 - 1125
  • [46] An evolutionary approach to multiprocessor scheduling of dependent tasks
    Nossal, R
    PARALLEL AND DISTRIBUTED PROCESSING, 1998, 1388 : 279 - 287
  • [47] An evolutionary approach to multiprocessor scheduling of dependent tasks
    Nossal, R
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 1998, 14 (5-6): : 383 - 392
  • [48] New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks
    Hidri, Lotfi
    Gharbi, Anis
    IEEE ACCESS, 2017, 5 : 6121 - 6133
  • [49] A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks
    Ling Wang
    Ye Xu
    Gang Zhou
    Shengyao Wang
    Min Liu
    The International Journal of Advanced Manufacturing Technology, 2012, 59 : 1113 - 1125
  • [50] SCHEDULING PREEMPTIVE MULTIPROCESSOR TASKS ON DEDICATED PROCESSORS
    BIANCO, L
    BLAZEWICZ, J
    DELLOLMO, P
    DROZDOWSKI, M
    PERFORMANCE EVALUATION, 1994, 20 (04) : 361 - 371
12345