Low-Overhead Non-Blocking Checkpointing Scheme for Mobile Computing Systems  

作　　者：门朝光 曹刘娟 王立闻 徐振朋 

机构地区：[1]R & D Center of High Dependability Computing Technology,Harbin Engineering University

出　　处：《Tsinghua Science and Technology》2007年第S1期110-115,共6页清华大学学报（自然科学版（英文版）

基　　金：the Postdoctoral Science Foundation (No. 20060390461);the Basic Research Foundation of Harbin Engineering University (Nos. HEUF040806,HEUFT05009, and HEUFP05020)

摘　　要：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.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.

关 键 词：mobile computing fault tolerant coordinated checkpoint rollback recovery 

分 类 号：TN929.5[电子电信—通信与信息系统] TP368.3[电子电信—信息与通信工程]