{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:37:17Z","timestamp":1781109437218,"version":"3.54.1"},"reference-count":25,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>Minimum-process coordinated checkpointing is a suitable approach to introduce fault tolerance in mobile distributed systems transparently. In order to balance the checkpointing overhead and the loss of computation on recovery, the authors propose a hybrid checkpointing algorithm, wherein an all-process coordinated checkpoint is taken after the execution of minimum-process coordinated checkpointing algorithm for a fixed number of times. In coordinated checkpointing, if a single process fails to take its checkpoint; all the checkpointing effort goes waste, because, each process has to abort its tentative checkpoint. In order to take the tentative checkpoint, an MH (Mobile Host) needs to transfer large checkpoint data to its local MSS over wireless channels. In this regard, the authors propose that in the first phase, all concerned MHs will take soft checkpoint only. Soft checkpoint is similar to mutable checkpoint. In this case, if some process fails to take checkpoint in the first phase, then MHs need to abort their soft checkpoints only. The effort of taking a soft checkpoint is negligibly small as compared to the tentative one. In the minimum-process coordinated checkpointing algorithm, an effort has been made to minimize the number of useless checkpoints and blocking of processes using probabilistic approach.<\/p>","DOI":"10.4018\/jdst.2011010101","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:14:42Z","timestamp":1319026482000},"page":"1-13","source":"Crossref","is-referenced-by-count":8,"title":["Soft-Checkpointing Based Hybrid Synchronous Checkpointing Protocol for Mobile Distributed Systems"],"prefix":"10.4018","volume":"2","author":[{"given":"Parveen","family":"Kumar","sequence":"first","affiliation":[{"name":"Meerut Institute of Engineering & Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachit","family":"Garg","sequence":"additional","affiliation":[{"name":"Singhania University, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jdst.2011010101-0","doi-asserted-by":"crossref","unstructured":"Acharya, A., & Badrinath, B. R. (1994). Checkpointing Distributed Applications on Mobile Computers. In Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems (pp. 73-80).","DOI":"10.1109\/PDIS.1994.331730"},{"key":"jdst.2011010101-1","doi-asserted-by":"publisher","DOI":"10.1504\/IJICS.2007.013957"},{"issue":"1","key":"jdst.2011010101-2","first-page":"135","article-title":"A Mobility-Based Checkpointing Protocol for Mobile Computing System.","volume":"2","author":"S.Biswas","year":"2010","journal-title":"International Journal of Computer Science & Information Technology"},{"key":"jdst.2011010101-3","unstructured":"Cao, G., & Singhal, M. (1998). On the Impossibility of Min-process Non-blocking Checkpointing and an Efficient Checkpointing Algorithm for Mobile Computing Systems. In Proceedings of the International Conference on Parallel Processing (pp. 37-44)."},{"key":"jdst.2011010101-4","doi-asserted-by":"publisher","DOI":"10.1109\/71.910871"},{"key":"jdst.2011010101-5","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"jdst.2011010101-6","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568525"},{"key":"jdst.2011010101-7","doi-asserted-by":"crossref","unstructured":"Elnozahy, E. N., Johnson, D. B., & Zwaenepoel, W. (1992). The Performance of Consistent Checkpointing. In Proceedings of the 11th Symposium on Reliable Distributed Systems (pp. 39-47).","DOI":"10.1109\/RELDIS.1992.235144"},{"key":"jdst.2011010101-8","unstructured":"Gao, Y., Deng, C., & Che, Y. (2008). An Adaptive Index-Based Algorithm Using Time-Coordination in Mobile Computing. In Proceedings of the International Symposiums on Information Processing (pp. 578-585)."},{"key":"jdst.2011010101-9","doi-asserted-by":"crossref","unstructured":"Garg, R., & Kumar, P. (2010). A Nonblocking Coordinated Checkpointing Algorithm for Mobile Computing Systems. International Journal of Computer Science issues, 7(3).","DOI":"10.5120\/710-998"},{"key":"jdst.2011010101-10","unstructured":"Higaki, H., & Takizawa, M. (1999). Checkpoint-recovery Protocol for Reliable Mobile Systems. Trans. of Information processing Japan, 40(1), 236-244."},{"key":"jdst.2011010101-11","doi-asserted-by":"publisher","DOI":"10.1109\/71.238629"},{"key":"jdst.2011010101-12","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.232562"},{"issue":"6","key":"jdst.2011010101-13","article-title":"Logging based Coordinated Checkpointing in Mobile Distributed Computing Systems.","volume":"51","author":"L.Kumar","year":"2005","journal-title":"Journal of the Institution of Electronics and Telecommunication Engineers"},{"key":"jdst.2011010101-14","unstructured":"Kumar, L., Misra, M., & Joshi, R. C. (2003). Low overhead optimal checkpointing for mobile distributed systems. In Proceedings 19th International Conference on IEEE Data Engineering (pp. 686-688). Washington, DC: IEEE."},{"issue":"1","key":"jdst.2011010101-15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1155\/2008\/982349","article-title":"A Low-Cost Hybrid Coordinated Checkpointing Protocol for Mobile Distributed Systems.","volume":"4","author":"P.Kumar","year":"2007","journal-title":"Mobile Information Systems"},{"key":"jdst.2011010101-16","doi-asserted-by":"crossref","unstructured":"Kumar, P., & Khunteta, A. (2010). A Minimum-Process Coordinated Checkpointing Protocol For Mobile Distributed System. International Journal of Computer Science issues, 7(3).","DOI":"10.5120\/701-982"},{"issue":"1","key":"jdst.2011010101-17","first-page":"40","article-title":"A low overhead Non-intrusive Hybrid Synchronous checkpointing protocol for mobile systems.","volume":"1","author":"P.Kumar","year":"2005","journal-title":"Journal of Multidisciplinary Engineering Technologies"},{"key":"jdst.2011010101-18","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"jdst.2011010101-19","doi-asserted-by":"publisher","DOI":"10.1145\/242857.242878"},{"key":"jdst.2011010101-20","unstructured":"Pradhan, D. K., Krishana, P. P., & Vaidya, N. H. (1996). Recovery in Mobile Wireless Environment: Design and Trade-off Analysis. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing (pp. 16-25)."},{"key":"jdst.2011010101-21","doi-asserted-by":"publisher","DOI":"10.1109\/71.539735"},{"key":"jdst.2011010101-22","unstructured":"Rao, S., & Naidu, M. M. (2008). A New, Efficient Coordinated Checkpointing Protocol Combined with Selective Sender-Based Message Logging. In Proceedings of the International Conference on Computer Systems and Applications. Washington, DC: IEEE."},{"key":"jdst.2011010101-23","doi-asserted-by":"crossref","unstructured":"Singh, P., & Cabillic, G. (2003). A Checkpointing Algorithm for Mobile Computing Environment (LNCS 2775, pp. 65-74).","DOI":"10.1007\/978-3-540-39867-7_6"},{"key":"jdst.2011010101-24","doi-asserted-by":"crossref","unstructured":"Weigang, N., Vrbsky, S. V., & Sibabrata, R. (2004). Pitfalls in nonblocking checkpointing. World Science\u2019s journal of Interconnected Networks, 1(5), 47-78.","DOI":"10.1142\/S0219265904001027"}],"container-title":["International Journal of Distributed Systems and Technologies"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=52047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:47:47Z","timestamp":1654123667000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jdst.2011010101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jdst.2011010101","relation":{},"ISSN":["1947-3532","1947-3540"],"issn-type":[{"value":"1947-3532","type":"print"},{"value":"1947-3540","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}