Name
Abstract | ||
|---|---|---|
In this paper, we have addressed the complex problem of recovery for concurrent failures in cluster computing environment. We have proposed a new approach in which we have dealt with both inter cluster orphan and lost messages unlike the existing works. The proposed recovery approach is free from the domino-effect and hence guarantees the least amount of recomputation after recovery. Besides, a process needs to save only its recent local checkpoint, which is also the case for a cluster. So number of trips to stable storage per process is always one during recovery. The proposed common check pointing interval is such that it enables a process to log the minimum number of messages it has sent. These features make our approach superior to the existing works. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-68083-3_4 | GPC |
Keywords | Field | DocType |
recent local checkpoint,domino-effect free crash recovery,concurrent failure,existing work,minimum number,cluster computing environment,inter cluster,proposed common check,new approach,proposed recovery approach,cluster federation,complex problem,cluster computing | Domino effect,Crash,Computer science,Computer network,Recovery approach,TRIPS architecture,Computer cluster,Distributed computing,Stable storage | Conference |
Volume | ISSN | ISBN |
5036 | 0302-9743 | 3-540-68081-0 |
Citations | PageRank | References |
5 | 0.42 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. Gupta | 1 | 152 | 51.48 |
| Shahram Rahimi | 2 | 172 | 40.74 |
| Vineel Allam | 3 | 5 | 0.76 |
| Vamshi Jupally | 4 | 5 | 0.76 |