SFT: A consistent checkpointing algorithm with short freezing time |
| |
Authors: | Xiaohui Wei Jiubin Ju |
| |
Affiliation: | (1) Department of Computer Science, Jilin University, 130023 Changchun, P.R. China |
| |
Abstract: | 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). |
| |
Keywords: | checkpointing fault-tolerance distributed system freezing time |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载免费的PDF全文 |