By Topic

On approximation of the bulk synchronous task scheduling problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fujimoto, N. ; Graduate Sch. of Inf. Sci. & Technol., Osaka Univ., Japan ; Hagihara, K.

The bulk synchronous task scheduling problem (BSSPO) is known as an effective task scheduling problem for distributed memory machines. We present 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. We also give an approximation algorithm with a performance guarantee of two for BSSPO in several restricted cases.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:14 ,  Issue: 11 )