Please use this identifier to cite or link to this item:
|Title:||Grid service reliability modeling and optimal task scheduling considering fault recovery|
|Keywords:||Ant colony optimization|
grid service reliability
|Source:||Guo, S., Huang, H.-Z., Wang, Z., Xie, M. (2011-03). Grid service reliability modeling and optimal task scheduling considering fault recovery. IEEE Transactions on Reliability 60 (1) : 263-274. ScholarBank@NUS Repository. https://doi.org/10.1109/TR.2010.2104190|
|Abstract:||There has been quite some research on the development of tools and techniques for grid systems, yet some important issues, e.g., grid service reliability and task scheduling in the grid, have not been sufficiently studied. For some grid services which have large subtasks requiring time-consuming computation, the reliability of grid service could be rather low. To resolve this problem, this paper introduces Local Node Fault Recovery (LNFR) mechanism into grid systems, and presents an in-depth study on grid service reliability modeling and analysis with this kind of fault recovery. To make LNFR mechanism practical, some constraints, i.e. the life times of subtasks, and the numbers of recoveries performed in grid nodes, are introduced; and grid service reliability models under these practical constraints are developed. Based on the proposed grid service reliability model, a multi-objective task scheduling optimization model is presented, and an ant colony optimization (ACO) algorithm is developed to solve it effectively. A numerical example is given to illustrate the influence of fault recovery on grid service reliability, and show a high efficiency of ACO in solving the grid task scheduling problem. © 2010 IEEE.|
|Source Title:||IEEE Transactions on Reliability|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 6, 2017
WEB OF SCIENCETM
checked on Nov 21, 2017
checked on Dec 10, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.