引用本文:汪东升,邵明珑.具有O(n)消息复杂度的协调检查点设置算法.软件学报,2003,14(1):43-48
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4887次   下载 6232 本文二维码信息
码上扫一扫!
分享到: 微信 更多
具有O(n)消息复杂度的协调检查点设置算法
汪东升1, 邵明珑1
清华大学,计算机科学与技术系,北京,100084
摘要:
协调检查点设置及回卷恢复技术作为一种有效的容错手段,已广泛地运用在集群等并行/分布计算机系统中.为了进一步降低协调检查点设置的时间和空间开销,提出了一种基于消息计数的协调检查点设置算法.该算法无须对底层消息通道的FIFO特性进行假设,并使同步阶段引入的控制消息复杂度由通常的O(n2)降低到O(n),有效地提高了系统的效率和扩展性.
关键词:  检查点设置  卷回恢复  同步  消息计数
DOI:
分类号:
基金项目:(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 (国家教育部高等院校骨干教师资助计划)
A Cooperative Checkpointing Algorithm with Message Complexity O(n)
WANG Dong-Sheng,SHAO Ming-Long
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.
Key words:  checkpointing  rollback recovery  synchronization  message counting

引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载  
分享到: 微信 更多
摘要:
关键词:  
DOI:
分类号:
基金项目:
Abstract:
Key words: