The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2003 vol.14)
pp: 1191-1199
Noriyuki Fujimoto , IEEE Computer Society
ABSTRACT
<p><b>Abstract</b>—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 <tmath>\frac{6}{5}</tmath> unless P=NP. This paper also gives an approximation algorithm with a performance guarantee of two for BSSPO in several restricted cases.</p>
INDEX TERMS
Task scheduling, distributed memory, fine grain, software overhead, message packaging, bulk synchronous schedule, NP-complete, approximation, nonapproximability.
CITATION
Noriyuki Fujimoto, Kenichi Hagihara, "On Approximation of the Bulk Synchronous Task Scheduling Problem", IEEE Transactions on Parallel & Distributed Systems, vol.14, no. 11, pp. 1191-1199, November 2003, doi:10.1109/TPDS.2003.1247678
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool