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 re-computation 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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gupta, B., Rahimi, S., Allam, V., & Jupally, V. (2008). Domino-effect free crash recovery for concurrent failures in cluster federation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5036 LNCS, pp. 4–17). https://doi.org/10.1007/978-3-540-68083-3_4
Mendeley helps you to discover research relevant for your work.