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 条

[41] Job release scheduling problem: Complexity and an approximation algorithm
Choi, Byung-Cheon
Chung, Jibok
DISCRETE APPLIED MATHEMATICS, 2013, 161 (06) : 858 - 863
[42] Approximation algorithm for the temperature-aware scheduling problem
Zhang, Sushu
Chatha, Karam S.
IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN DIGEST OF TECHNICAL PAPERS, VOLS 1 AND 2, 2007, : 281 - 288
[43] The symmetric quadratic knapsack problem: approximation and scheduling applications
Kellerer, Hans
Strusevich, Vitaly A.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 111 - 161
[44] An Improved Approximation Algorithm for the Ancient Scheduling Problem with Deadlines
Levner, Eugene
Elalouf, Amir
2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2014, : 113 - 116
[45] Approximation Algorithms for the Multi-Vehicle Scheduling Problem
Bhattacharya, Binay
Hu, Yuzhuang
ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 192 - 205
[46] The symmetric quadratic knapsack problem: approximation and scheduling applications
Hans Kellerer
Vitaly A. Strusevich
4OR, 2012, 10 : 111 - 161
[47] An improved approximation algorithm for a scheduling problem with transporter coordination
Wang, Yinling
Han, Xin
Zhang, Yong
Blazewicz, Jacek
JOURNAL OF SCHEDULING, 2023, 26 (06) : 559 - 570
[48] Approximation algorithms for the multiprocessor open shop scheduling problem
Schuurman, P
Woeginger, GJ
OPERATIONS RESEARCH LETTERS, 1999, 24 (04) : 157 - 163
[49] An approximation algorithm for the task-coalition assignment problem
Murata, Y
Ishihara, Y
Ito, M
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (04): : 685 - 693
[50] An approximation algorithm for the task-coalition assignment problem
Murata, Yoshihiro
Ishihara, Yasunori
Ito, Minoru
IEICE Transactions on Information and Systems, 2002, E85-D (04) : 685 - 693

← 1 2 3 4 5 →