By Topic

A modified genetic algorithm for DAG scheduling in grid 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

2 Author(s)
Beibei Zhu ; Dept. of Comput. Sci. & Technol., Shandong Univ., Jinan, China ; Hongze Qiu

Distributed systems play a vital role in the improvement of high performance computing. Of primary concern when analyzing these systems is DAG scheduling. The problem of DAG scheduling can be stated as scheduling and mapping of the precedence-constrained task graph to processors so that the completion time can be minimized. It is known to be a NP-complete problem. Several studies have demonstrated that genetic algorithm based on the principles of evolution perform better than others generally. In this paper, we will propose an modified genetic algorithm by improving genetic operators and experimental studies show that the modified genetic algorithm converge quickly and can get optimal solution.

Published in:

Software Engineering and Service Science (ICSESS), 2012 IEEE 3rd International Conference on

Date of Conference:

22-24 June 2012