By Topic

A two-phase heuristic for the scheduling of independent tasks on computational grids

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

4 Author(s)
Pinel, F. ; Comput. Sci. & Commun., Univ. of Luxembourg, Luxembourg, Luxembourg ; Pecero, J. ; Bouvry, P. ; Khan, S.U.

The sensitivity analysis of a cellular genetic algorithm with local search is used to design a new and simpler heuristic for the problem of scheduling independent tasks. The proposed heuristic improves the previously known Min-Min heuristic. Moreover, it provides schedules of similar quality to the reference cellular genetic algorithm in a significantly reduced runtime. This heuristic is evaluated across twelve different classes of scheduling instances.

Published in:

High Performance Computing and Simulation (HPCS), 2011 International Conference on

Date of Conference:

4-8 July 2011