By Topic

A fast genetic algorithm based static heuristic for scheduling independent tasks on heterogeneous systems

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)
Menghani, G. ; Dept. of Comput. Eng., Thadomal Shahani Eng. Coll., Mumbai, India

Scheduling of tasks in a heterogeneous computing (HC) environment is a critical task. It is also a well-known NP-complete problem, and hence several researchers have presented a number of heuristics for the same. The paper begins with introducing a new heuristic called Sympathy, and later a variant called Segmented Sympathy. A new Genetic Algorithm based heuristic using the Segmented Sympathy heuristic is proposed, which is aimed at improving over the speed and makespan of the implementation by Braun et al. Finally, the results of Simulation reveal that the proposed Genetic Algorithm gave up to 8.34% and on an average 3.42% better makespans. The new heuristic is also about 160% faster with respect to the execution time.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010