THE PERFORMANCE OF SOFT CHEKPOINTING APPROACH IN MOBILE COMPUTING SYSTEMS

α
Ruchi Tuli
Ruchi Tuli

Send Message

To: Author

THE PERFORMANCE OF SOFT CHEKPOINTING APPROACH IN MOBILE COMPUTING SYSTEMS

Article Fingerprint

ReserarchID

W5788

THE PERFORMANCE OF SOFT CHEKPOINTING APPROACH IN MOBILE COMPUTING SYSTEMS Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. In literature mostly, two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. Since MHs are prone to failure, so they have to transfer a large amount of checkpoint data and control information to its local MSS which increases bandwidth overhead. In this paper, we introduce the concept of “Soft checkpoint” which is neither a tentative checkpoint nor a permanent checkpoint, to design efficient checkpointing algorithms for mobile computing systems. Soft checkpoints can be saved anywhere, e.g., the main memory or local disk of MHs. Before disconnecting from the MSS, these soft checkpoints are converted to hard checkpoints and are sent to MSSs stable storage. In this way, taking a soft checkpoint avoids the overhead of transferring large amounts of data to the stable storage at MSSs over the wireless network. We have also shown that our soft checkpointing scheme also adapts its behaviour to the characteristics of network.

References

13 Cites in Article
  1. Chandreyee Chowdhury,Sarmistha Neogy (2007). A Consistent Checkpointing-Recovery Protocol for Minimal Number of Nodes in Mobile Computing System.
  2. R Koo,S Toueg (1987). Checkpointing and Rollback-Recovery for Distributed Systems.
  3. G Cao,M Singhal (1998). On Coordinated Checkpointing in Distributed Systems.
  4. E Elnozahy,D Johnson,W Zwaenepoel (1992). ªThe Performance of Consistent Checkpointing.
  5. R Prakash,M Singhal (1996). Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems.
  6. A Acharya,B Badrinath (1994). Checkpointing distributed applications on mobile computers.
  7. D Pradhan,P Krishna,N Vaidya (1996). Recovery in mobile environments: Design and trade-off analysis.
  8. G Cao,M Singhal (2001). Mutable Checkpoints : A New checkpointing Approach for Mobile Computing Systems.
  9. B Randell (1975). System structure for software fault tolerance.
  10. N Neves (1998). Time-based coordinated checkpointing.
  11. P Kumar,R Garg (2010). Soft checkpointing based coordinated checkpointing protocol for Mobile Distributed Systems.
  12. S Kumar,R Chauhan,P Kumar (2010). Reliable Soft-Checkpoint Based Fault Tolerance Approach for Mobile Distributed Systems.
  13. Parveen Kumar,Lalit Kumar,R K Chauhan (2006). A Hybrid Coordinated Checkpointing Protocol for Mobile Computing Systems.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Ruchi Tuli. 1970. \u201cTHE PERFORMANCE OF SOFT CHEKPOINTING APPROACH IN MOBILE COMPUTING SYSTEMS\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 9): .

Download Citation

Journal Specifications
Keywords
Version of record

v1.2

Issue date

May 25, 2011

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 20766
Total Downloads: 10880
2026 Trends
Related Research

Published Article

Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. In literature mostly, two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. Since MHs are prone to failure, so they have to transfer a large amount of checkpoint data and control information to its local MSS which increases bandwidth overhead. In this paper, we introduce the concept of “Soft checkpoint” which is neither a tentative checkpoint nor a permanent checkpoint, to design efficient checkpointing algorithms for mobile computing systems. Soft checkpoints can be saved anywhere, e.g., the main memory or local disk of MHs. Before disconnecting from the MSS, these soft checkpoints are converted to hard checkpoints and are sent to MSSs stable storage. In this way, taking a soft checkpoint avoids the overhead of transferring large amounts of data to the stable storage at MSSs over the wireless network. We have also shown that our soft checkpointing scheme also adapts its behaviour to the characteristics of network.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

THE PERFORMANCE OF SOFT CHEKPOINTING APPROACH IN MOBILE COMPUTING SYSTEMS

Ruchi Tuli
Ruchi Tuli

Research Journals