By Topic

A Dual Heuristic Scheduling Strategy Based on Task Partition in Grid 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
$33 $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)
Ding Ding ; Sch. of Comput. & Inf. Technol., Beijing Jiaotong Univ., Beijing, China ; Siwei Luo ; Zhan Gao

Focusing on the fact that the collection of independent tasks to be scheduled onto the grid is always on a large-scale, a conception of task partition is proposed to group tasks exclusively according to the machine that gives the earliest completion time. As a result, several tasks in different task partitions can be scheduled at the same time, which reduces the range of task searching and eliminates the re-assignment of tasks completely. Furthermore, a Task Partition-Based Heuristic (TPBH) is presented with sufferage as the first heuristic and minimum completion time as the second one. Simulation results confirm that this dual heuristic scheduling strategy can reduce both makespan and the runtime; and the larger the task set is, the better performance the algorithm shows.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:1 )

Date of Conference:

24-26 April 2009