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 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cao, J., Chen, Y., Zhang, K., He, Y.: Checkpointing in Hybrid Distributed Systems. In: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2004), Hong Kong, China, pp. 136–141 (2004)
Monnet, S., Morin, C., Badrinath, R.: Hybrid Checkpointing for Parallel Applications in Cluster Federations. In: Proceedings of the 4th IEEE/ACM International Symposium on Cluster Computing and the Grid, Chicago, USA, pp. 773–782 (2004)
Gupta, B., Rahimi, S., Rias, R.A., Bangalore, G.: A Low-Overhead Non-Blocking Checkpointing Algorithm for Mobile Computing Environment. In: Chung, Y.-C., Moreira, J.E. (eds.) GPC 2006. LNCS, vol. 3947, pp. 597–608. Springer, Heidelberg (2006)
Koo, R., Toueg, S.: Checkpointing and Rollback-Recovery for Distributed Systems. IEEE Transactions on Software Engineering SE-13(1), 23–31 (1987)
Wang, Y.: Consistent Global Checkpoints That Contain a Given Set of Local Checkpoints. IEEE Transactions on Computers 46(4), 456–468 (1997)
Tsai, J., Kuo, S.-Y., Wang, Y.-M.: Theoretical Analysis for Communication-Induced Checkpointing Protocols with Rollback Dependency Trackability. IEEE Transactions on Parallel and Distributed Systems 9(10), 963–971 (1998)
Gupta, B., Banerjee, S.K., Liu, B.: Design of New Roll-Forward Recovery Approach for Distributed Systems. IEE Proceedings-Computers and Digital Techniques 149(3), 105–112 (2002)
Manivannan, D., Singhal, M.: Asynchronous Recovery Without using Vector Timestamps. Journal of Parallel and Distributed Computing 62(2), 1695–1728 (2002)
Qi, X., Parmer, G., West, R.: An Efficient End-Host Architecture for Cluster Communication. In: Proceedings of the 2004 IEEE Intl. Conf. on Cluster Computing, San Diego, USA, pp. 83–92 (2004)
Singhal, M., Shivaratri, N.G.: Advanced Concepts in Operating Systems. McGraw-Hill Inc., New York (1994)
Elnozahy, E.N., Johnson, D.B., Zwaenepoel, W.: The Performance of Consistent Check Pointing. In: Proceedings of the 11th Symp. on Reliable Distributed Systems, pp. 86–95 (1992)
Cao, G., Singhal, M.: On Coordinated Checkpointing in Distributed Systems. IEEE Transactions on Parallel and Distributed Systems 9(12), 1213–1225 (1998)
Gupta, B., Rahimi, S., Ahmad, R., Chirra, R.: A Novel Recovery Approach for Cluster Federations. In: Cérin, C., Li, K.-C. (eds.) GPC 2007. LNCS, vol. 4459, pp. 519–530. Springer, Heidelberg (2007)
Venkatesan, S., Juang, T., Alagar, S.: Optimistic Crash Recovery Without Changing Application Messages. IEEE Transactions on Parallel and Distributed Systems 8(3), 263–271 (1997)
Jalote, P.: Fault Tolerance in Distributed Systems. PTR Prentice Hall, New Jersey (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, B., Rahimi, S., Allam, V., Jupally, V. (2008). Domino-Effect Free Crash Recovery for Concurrent Failures in Cluster Federation. In: Wu, S., Yang, L.T., Xu, T.L. (eds) Advances in Grid and Pervasive Computing. GPC 2008. Lecture Notes in Computer Science, vol 5036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68083-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-68083-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68081-9
Online ISBN: 978-3-540-68083-3
eBook Packages: Computer ScienceComputer Science (R0)