By Topic

On the design of task scheduling in the heterogeneous computing environments

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

1 Author(s)
Hsin-An Chen ; National Tai-Chung Teachers Coll., Taichung, Taiwan

An efficient task scheduling in a heterogeneous computing (HC) system is an important issue to meet the computational requirements of a large number of parallel applications. In this paper, we have proposed a non-preemptive static scheduling algorithm for the HC systems, called the multiple strict bound constraints (MSBC) algorithm. The MSBC algorithm employs an alternative task-prioritized scheme in stead of that used by the heterogeneous earliest finish time (HEFT) algorithm. Additionally, we also exploit available idle time slots in every scheduling round of the MSBC algorithm. In order to provide an unbiased comparison with the existing algorithms, the randomly generated graphs are considered as experimental test-beds. The experimental results show the superiority of our proposed algorithm to those presented previously. Therefore, our proposed algorithm may be used to raise the performance of the parallel applications executed in the HC systems.

Published in:

Communications, Computers and signal Processing, 2005. PACRIM. 2005 IEEE Pacific Rim Conference on

Date of Conference:

24-26 Aug. 2005