logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Low-cost checkpointing with mutable checkpoints in mobile computing systems

delete2024-09-04
delete21
PRE
AI
G
Guohong Cao *
M
M. Singhal
DOI：10.1109/ICDCS.1998.679776delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Mobile computing raises many new issues, such as lack of stable storage, law bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. In this paper, we introduce the concept of ''mutable checkpoint, which is neither a tentative checkpoint nor a permanent checkpoint. Mutable checkpoints can be saved any where: e.g., the memory or local disk of MHs. In this way, taking a mutable checkpoint avoids the overhead of transferring large amount of data to the stable storage in MSS over the wireless network. Based on mutable checkpoints, oar non-blocking algorithm avoids avalanche effect, minimizes She number of synchronization messages, and forces only a minimum number of processes to take their checkpoints on the stable storage.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

I
International Conference on Distributed Computing Systems, Proceedings
IF:
0
Papers:
2
Citations:
0

Organization

No organization information available