SFT: A Consistent Checkpointing Algorithm with Short Freezing Time  

作　　者：魏晓辉 鞠九滨 等 

机构地区：[1]DepartmentofComputerScience,JilinUniversity,Changchun130023,P.R.China

出　　处：《Journal of Computer Science & Technology》2000年第2期169-175,共7页计算机科学技术学报（英文版）

基　　金：the National Natural Science Foundation of China !69673012

摘　　要：A consistent checkpointing algorithm with short freezing time (SFT) is presented in this paper. It supports fault-tolerance in distributed systems. The algorithm has shorter freezing time, lower overhead, and simplicity of recovery. To make checkpoint time shorter, a special control message (Munblock) is used to ensure that a process can respond the checkpoint event quickly at any given time. Moreover, main memory algorithm is used to improve the concurrency of checkpointing. By using SFT, the freezing time resulted by checkpointing is less than 0.03s. Furthermore, the control message number of SFT is only O(n).A consistent checkpointing algorithm with short freezing time (SFT) is presented in this paper. It supports fault-tolerance in distributed systems. The algorithm has shorter freezing time, lower overhead, and simplicity of recovery. To make checkpoint time shorter, a special control message (Munblock) is used to ensure that a process can respond the checkpoint event quickly at any given time. Moreover, main memory algorithm is used to improve the concurrency of checkpointing. By using SFT, the freezing time resulted by checkpointing is less than 0.03s. Furthermore, the control message number of SFT is only O(n).

关 键 词：CHECKPOINTING FAULT-TOLERANCE distributed system freezing time 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]