By Topic

A Hybrid GA-based Scheduling Algorithm for 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)
Han Yu ; Phys. Realization Res. Center of Motorola Labs., Schaumburg, IL

We design a hybrid algorithm to schedule the execution of a group of dependent tasks for heterogeneous computing environments. The algorithm consists of two elements: a genetic algorithm (GA) to map tasks to processors, and a heuristic-based approach to assign the execution order of tasks. This algorithm takes advantage of both the exploration power of GA and the heuristics embedded in the scheduling problem, so it can effectively reduce the search space while not sacrificing the search quality. The experiments show that this algorithm performs consistently better than heterogeneous earliest-finish-time (HEFT) without incurring much computational cost. Multiple runs of the algorithm can further improve the search result.

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007