作者
Lalit Kumar, Manoj Mishra, Ramesh Chander Joshi
发表日期
2003/3/5
研讨会论文
Proceedings 19th International Conference on Data Engineering (Cat. No. 03CH37405)
页码范围
686-688
出版商
IEEE
简介
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 nonblocking and require minimum number of processes to checkpoint. Cao and Singhal [G. Cao et al., (2001)] achieved both by introducing the concept of mutable checkpoints. Many of these mutable checkpoints may be useless. We propose a nonblocking minimum process coordinated checkpointing protocol that not only minimizes useless checkpoints but also minimizes overall bandwidth required over wireless channels.
引用总数
2005200620072008200920102011201220132014201520162017201820192020202120222023221424632232112251
学术搜索中的文章
L Kumar, M Mishra, RC Joshi - Proceedings 19th International Conference on Data …, 2003