By Topic

Scheduling Algorithm Based on Task Priority in Heterogeneous Computing Environment

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

3 Author(s)
Yu Zhenxia ; Chengdu Univ. of Inf. Technol., Chengdu ; Meng Fang ; Shangming Sheng

In this paper, a scheduling algorithm suitable for independent heterogeneous tasks on heterogeneous computing has been studied. With the objective to find the best point between matching and load balancing , the concept of task priority has been used to improve the existing algorithm, and the simulation of our algorithm has been performed .The results demonstrated that through prioritizing tasks, a balance between load balancing and shortest execution time has been reached, and better scheduling performance has been achieved.

Published in:

Computer Science and Information Technology, 2008. ICCSIT '08. International Conference on

Date of Conference:

Aug. 29 2008-Sept. 2 2008