Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/AICCSA.2011.6126596 | AICCSA |
Keywords | Field | DocType |
checkpointing,genetic algorithms,grid computing,scheduling,software fault tolerance,checkpoint recovery technique,computational grid nodes,economic grid fault tolerance scheduling,fault tolerance technique,geographically distributed resources,modified genetic algorithm,recovery technique | Grid computing,Computer science,Scheduling (computing),Computer network,Software fault tolerance,Real-time computing,Fault tolerance,Schedule,Grid fault,Grid,Genetic algorithm,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir I. Alfoly | 1 | 0 | 0.34 |
| M. B. AbdelHalim | 2 | 45 | 7.21 |
| S. Senbel | 3 | 0 | 0.34 |