On approximation of the bulk synchronous task scheduling problem

被引：0
|
作者：
Fujimoto, N [1 ]
Hagihara, K [1 ]
机构：
[1] Osaka Univ, Grad Sch Informat Sci & Technol, Toyonaka, Osaka 5608531, Japan
来源：
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 2003年 / 14卷 / 11期
关键词：
task scheduling; distributed memory; fine grain; software overhead; message packaging; bulk synchronous schedule; NP-complete; approximation; nonapproximability;
D O I：
10.1109/TPDS.2003.1247678
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The bulk synchronous task scheduling problem (BSSPO) is known as an effective task scheduling problem for distributed-memory machines. This paper presents a proof of NP-completeness of the decision counterpart of BSSPO, even in the case of makespan of at most five. This implies nonapproximability of BSSPO, meaning that there is no approximation algorithm with performance guarantee smaller than 6/5 unless P = NP. This paper also gives an approximation algorithm, with a performance guarantee of two for BSSPO in several restricted cases.
引用
收藏
页码：1191 / 1199
页数：9
相关论文
共 50 条
  • [1] NP-completeness of the bulk synchronous task scheduling problem and its approximation algorithm
    Fujimoto, N
    Hagihara, K
    I-SPAN 2000: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES ALGORITHMS AND NETWORKS, PROCEEDINGS, 2000, : 127 - 132
  • [2] Non-approximability of the bulk synchronous task scheduling problem
    Fujimoto, N
    Hagihara, K
    EURO-PAR 2002 PARALLEL PROCESSING, PROCEEDINGS, 2002, 2400 : 225 - 233
  • [3] An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
    Fan, Liya
    Zhang, Fa
    Wang, Gongming
    Liu, Zhiyong
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2012, 72 (05) : 693 - 704
  • [4] An approximation result for a duo-processor task scheduling problem
    DellOlmo, P
    Giordani, S
    Speranza, MG
    INFORMATION PROCESSING LETTERS, 1997, 61 (04) : 195 - 200
  • [5] PROBLEM IN BULK SERVICE SCHEDULING
    NEMHAUSER, GL
    YU, PL
    OPERATIONS RESEARCH, 1972, 20 (04) : 813 - +
  • [6] Approximation Algorithms on Multiprocessor Task Scheduling
    Huang Jingui
    Li Rongheng
    2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND TECHNOLOGY, VOL II, PROCEEDINGS, 2009, : 303 - +
  • [7] Approximation of the supply scheduling problem
    Chauhan, SS
    Eremeev, AV
    Romanova, AA
    Servakh, VV
    Woeginger, GJ
    OPERATIONS RESEARCH LETTERS, 2005, 33 (03) : 249 - 254
  • [8] Approximation algorithm for the static task scheduling on multiprocessors
    Brest, Janez
    Žumer, Viljem
    Elektrotehniski Vestnik/Electrotechnical Review, 2000, 67 (02): : 138 - 144
  • [9] Approximation algorithms for general parallel task scheduling
    Kwon, OH
    Chwa, KY
    INFORMATION PROCESSING LETTERS, 2002, 81 (03) : 143 - 150
  • [10] An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team
    Hari, Sai Krishna Kanth
    Nayak, Abhishek
    Rathinam, Sivakumar
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2020, 5 (02): : 2146 - 2153
12345