首页 | 本学科首页   官方微博 | 高级检索  
     

Low-Overhead Non-Blocking Checkpointing Scheme for Mobile Computing Systems
基金项目:中国博士后科学基金;哈尔滨工程大学校科研和教改项目
摘    要:When applied to mobile computing systems,checkpoint protocols for distributed computing systems would face many new challenges, such as low wireless bandwidth, frequent disconnections, and lack of stable storage at mobile hosts. This paper proposes a novel checkpoint protocol to effectively reduce the coordinating overhead. By using a communication vector, only a few processes participate in the checkpointing event. During checkpointing, the scheme can save the time used to trace the dependency tree by sending checkpoint requests to dependent processes at once. In addition, processes are non- blocking in this scheme, since the inconsistency is resolved by the piggyback technique. Hence the unnecessary and orphan messages can be avoided. Compared with the traditional coordinated checkpoint approach, the proposed non-blocking algorithm obtains a minimal number of processes to take checkpoints. It also reduces the checkpoint latency, which brings less overhead to mobile host with limited resources.


Low-Overhead Non-Blocking Checkpointing Scheme for Mobile Computing Systems
MEN Chaoguang,CAO Liujuan,WANG Liwen,XU Zhenpeng. Low-Overhead Non-Blocking Checkpointing Scheme for Mobile Computing Systems[J]. Tsinghua Science and Technology, 2007, 12(Z1): 110-115
Authors:MEN Chaoguang  CAO Liujuan  WANG Liwen  XU Zhenpeng
Abstract:When applied to mobile computing systems,checkpoint protocols for distributed computing systems would face many new challenges, such as low wireless bandwidth, frequent disconnections, and lack of stable storage at mobile hosts. This paper proposes a novel checkpoint protocol to effectively reduce the coordinating overhead. By using a communication vector, only a few processes participate in the checkpointing event. During checkpointing, the scheme can save the time used to trace the dependency tree by sending checkpoint requests to dependent processes at once. In addition, processes are non- blocking in this scheme, since the inconsistency is resolved by the piggyback technique. Hence the unnecessary and orphan messages can be avoided. Compared with the traditional coordinated checkpoint approach, the proposed non-blocking algorithm obtains a minimal number of processes to take checkpoints. It also reduces the checkpoint latency, which brings less overhead to mobile host with limited resources.
Keywords:mobile computing  fault tolerant  coordinated checkpoint  rollback recovery
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号