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 条
  • [21] Scheduling independent multiprocessor tasks
    Amoura, AK
    Bampis, E
    Kenyon, C
    Manoussakis, Y
    ALGORITHMICA, 2002, 32 (02) : 247 - 261
  • [22] Multiprocessor Scheduling of Elastic Tasks
    Orr, James
    Baruah, Sanjoy
    RTNS 2019: PROCEEDINGS OF THE 27TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2019), 2020, : 133 - 142
  • [23] Scheduling Independent Multiprocessor Tasks
    Algorithmica, 2002, 32 : 247 - 261
  • [24] Deadline scheduling of multiprocessor tasks
    Blazewicz, J
    Drozdowski, M
    deWerra, D
    Weglarz, J
    DISCRETE APPLIED MATHEMATICS, 1996, 65 (1-3) : 81 - 95
  • [25] On an on-line scheduling problem for parallel jobs
    Naroska, E
    Schwiegelshohn, U
    INFORMATION PROCESSING LETTERS, 2002, 81 (06) : 297 - 304
  • [26] Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks
    Ying, Kuo-Ching
    Lin, Shih-Wei
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 92 : 132 - 141
  • [27] Scheduling of independent dedicated multiprocessor tasks
    Bampis, E
    Caramia, M
    Fiala, J
    Fishkin, AV
    Iovanella, A
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 391 - 402
  • [28] Scheduling multiprocessor tasks with chain constraints
    Blazewicz, J
    Liu, Z
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 231 - 241
  • [29] SCHEDULING ALGORITHM FOR NONPREEMPTIVE MULTIPROCESSOR TASKS
    LIN, JF
    CHEN, SJ
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1994, 28 (04) : 85 - 92
  • [30] Scheduling multiprocessor tasks with genetic algorithms
    Correa, RC
    Ferreira, A
    Rebreyend, P
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (08) : 825 - 837
12345