Abstract | ||
---|---|---|
Grid reliability analysis and modeling are not easy tasks because of the complexity and large scale of the system. 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, RNFR and LNFR are proposed in literature. This paper describes the property of the grid computing systems and analyzes the grid program and service reliability. In this paper, we propose a fault tolerance mechanism, namely LRNFR, based both on RNFR and LNFR in a complementary manner with a periodic migration. We select the most reliable node among the set of Neighboring Collaborators. The migration process is divided by the MDTTR of the failed node until its repair or the migration of all its programs. Experiments demonstrate the performance of the proposed approach. |
Year | DOI | Venue |
---|---|---|
2014 | 10.3233/MGS-140224 | Multiagent and Grid Systems |
Keywords | Field | DocType |
Large scale systems, grid computing, fault tolerance, process migration, service reliability | Grid computing,Division (mathematics),Computer science,Process migration,Real-time computing,Fault tolerance,Periodic graph (geometry),Grid,Distributed computing,Computation | Journal |
Volume | Issue | ISSN |
10 | 4 | 1574-1702 |
Citations | PageRank | References |
1 | 0.35 | 33 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rebbah Mohammed | 1 | 2 | 1.39 |
Yahya Slimani | 2 | 164 | 33.59 |
Abdelkader Benyettou | 3 | 95 | 15.17 |
Lionel Brunie | 4 | 686 | 126.62 |