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.
展开▼
机译：移动分布式计算系统（MDCS）的检查点算法需要处理许多新问题，例如：移动性，无线通道的低带宽，移动节点上缺乏稳定的存储，断开连接，电池电量有限以及移动节点的高故障率。这些问题使传统的检查点技术不适合移动分布式系统。如果协调检查点是非阻塞的并且需要最少数量的过程来检查点，则对MDCS的检查点可能很有用。曹和辛哈尔[G. Cao et al。，（2001）]通过引入可变检查点的概念实现了两者。这些可变检查点中的许多检查点可能是无用的。我们提出了一种无阻塞的最小过程协调检查点协议，该协议不仅可以最大程度地减少无用的检查点，而且还可以最大程度地减少无线信道上所需的总体带宽。
展开▼
