失效恢复机制下的网格任务冗余调度优化

Translated title of the contribution: Optimal redundant scheduling of grid tasks based on fault recovery

郭夙昌, 黄洪钟*, 许焕卫, 万虎, 谢旻

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

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.
Translated title of the contributionOptimal redundant scheduling of grid tasks based on fault recovery
Original languageChinese (Simplified)
Pages (from-to)154-160
Journal机械工程学报
Volume46
Issue number23
Publication statusPublished - Dec 2010
Externally publishedYes

Research Keywords

  • 网格
  • 服务可靠性
  • 失效恢复
  • 冗余调度
  • 遗传算法
  • Grid
  • Service reliability
  • Fault recovery
  • Redundant scheduling
  • Genetic algorithm

Fingerprint

Dive into the research topics of 'Optimal redundant scheduling of grid tasks based on fault recovery'. Together they form a unique fingerprint.

Cite this