By Topic

Economic grid fault tolerance scheduling using modified Genetic Algorithm

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

3 Author(s)
Alfoly, A.I. ; Arab Acad. for Sci., Technol. & Maritime Transp., Cairo, Egypt ; Abdelhalim, M.B. ; Senbel, S.

Computational grids allow the sharing of geographically distributed resources in an efficient way, extending the boundaries of what we perceive as distributed computing. It is a fact that the computational grid nodes are not 100% secure from failure. Here comes a problem on how to handle failing nodes and effectively schedule and distribute the required work on the participating nodes and, in the same time, provide assurance that the task will be completed successfully. Additionally, when applying a recovery technique to an Economic Grid, the problem of maintaining the cost arises. In this paper, we propose an enhancement to a fault tolerance Genetic Algorithm (GA) using a checkpoint recovery technique. The enhancement focuses on finding a schedule which tries to minimize the running costs resulting from the overhead of implementing fault tolerance technique and in the same time tries to satisfy the quality constraints of the user. The results show that without adding these factors, the schedule running costs may be uncontrollable from the point of view of the grid owner.

Published in:

Computer Systems and Applications (AICCSA), 2011 9th IEEE/ACS International Conference on

Date of Conference:

27-30 Dec. 2011