Please use this identifier to cite or link to this item:
Title: Optimal redundant scheduling of grid tasks based on fault recovery
Authors: Guo, S.
Huang, H.
Xu, H.
Wan, H.
Xie, M. 
Keywords: Fault recovery
Genetic algorithm
Redundant scheduling
Service reliability
Issue Date: 5-Dec-2010
Source: Guo, S.,Huang, H.,Xu, H.,Wan, H.,Xie, M. (2010-12-05). Optimal redundant scheduling of grid tasks based on fault recovery. Jixie Gongcheng Xuebao/Journal of Mechanical Engineering 46 (23) : 154-160. ScholarBank@NUS Repository.
Abstract: Grid technology is an important tool to solve computation-intensive problems in current academic and industrial circles. Due to the complexity of grid system, there are a lot of problems unsolved in grid reliability. To cope with the low level of grid service reliability, a fault recovery mechanism in grid resources is introduced and a more practical grid service reliability model is proposed, in which the constraints on the life numbers of subtasks and on the numbers of recoveries performed can be imposed freely by resource owners. In order to further improve grid service reliability, a redundant scheduling of grid tasks is used. Based on the proposed grid service reliability model considering fault recovery, an optimization model with a cost constraint for redundant scheduling problem is presented to maximize the grid service reliability. A genetic algorithm is developed to solve it and some special repair operators are designed to adjust the infeasible solutions of the chromosomes, which can ensure normal algorithm operation. A numerical example is given to show the efficiency of the genetic algorithm. © 2010 Journal of Mechanical Engineering.
Source Title: Jixie Gongcheng Xuebao/Journal of Mechanical Engineering
ISSN: 05776686
DOI: 10.3901/JME.2010.23.154
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 19, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.