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

Low overhead optimal checkpointing for mobile distributed

delete
delete9
PRE
AI
DOI：delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A checkpoint algorithm for a mobile distributed computing system (MDCS) needs to handle many new issues like: mobility, low bandwidth of wireless channels, lack of stable storage on mobile nodes, disconnections, limited battery power and high failure rate of mobile nodes. These issues make traditional checkpointing techniques unsuitable for mobile distributed systems. Coordinated checkpointing may be useful to checkpoint MDCS if it is non-blocking and require minimum number of processes to checkpoint. Cao and Singhal [1] achieved both by introducing the concept of mutable checkpoints. Many of these mutable checkpoints may be useless. In this paper, we propose a non-blocking minimum process coordinated checkpointing protocol that not only minimizes useless checkpoints but also minimizes overall bandwidth required over wireless channels.
Keywords:
COMPUTING SYSTEMS

Journal

I
International Conference on Data Engineering, Proceedings
IF:
0
Papers:
1
Citations:
0

Organization

No organization information available