###
DOI:
:2003.14(1):43-48

具有O(n)消息复杂度的协调检查点设置算法
汪东升,邵明珑
(清华大学,计算机科学与技术系,北京,100084)
A Cooperative Checkpointing Algorithm with Message Complexity O(n)
WANG Dong-Sheng,SHAO Ming-Long
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3008   Download 2792
Received:September 06, 2001    Revised:August 02, 2002
> 中文摘要: 协调检查点设置及回卷恢复技术作为一种有效的容错手段,已广泛地运用在集群等并行/分布计算机系统中.为了进一步降低协调检查点设置的时间和空间开销,提出了一种基于消息计数的协调检查点设置算法.该算法无须对底层消息通道的FIFO特性进行假设,并使同步阶段引入的控制消息复杂度由通常的O(n2)降低到O(n),有效地提高了系统的效率和扩展性.
中文关键词: 检查点设置  卷回恢复  同步  消息计数
Abstract:The technology of cooperative checkpointing and rollback recovery as an effective method of fault tolerance, has been widely used on the parallel or distributed computer systems, such as cluster of computers. In order to reduce the overhead of time and space, a cooperative checkpointing algorithm based on message counting is given in this paper. While reducing a message complexity during synchronization from O(n2) to O(n), improving system's efficiency and scalability, this algorithm is also fit for those non-FIFO message passing systems.
文章编号:     中图分类号:    文献标志码:
基金项目:(Supported by the National High-Tech Research and Development Plan of China under Grant No.2001AA111010 (国家高技术研究发展计划); the Assisting Project of Ministry of Education of China for Backbone Teachers of University and College (国家教育部高等院校骨干教师资助计划) (Supported by the National High-Tech Research and Development Plan of China under Grant No.2001AA111010 (国家高技术研究发展计划); the Assisting Project of Ministry of Education of China for Backbone Teachers of University and College (国家教育部高等院校骨干教师资助计划)
Foundation items:
Reference text:

汪东升,邵明珑.具有O(n)消息复杂度的协调检查点设置算法.软件学报,2003,14(1):43-48

WANG Dong-Sheng,SHAO Ming-Long.A Cooperative Checkpointing Algorithm with Message Complexity O(n).Journal of Software,2003,14(1):43-48