计算机科学与技术

于动态分组的两级检查点算法

展开
  • 重庆大学 计算机学院,重庆 400044
刘国良(1977-),男,博士,主要从事容错计算、可信计算研究

收稿日期: 2010-06-07

  修回日期: 2010-09-27

  网络出版日期: 2011-01-02

基金资助

重庆市自然科学基金资助项目(CSTC2008BB2307)

Two-Level Checkpoint Algorithm Based on Dynamic Grouping

Expand
  • Chongqing university computer college, chongqing 400044
刘国良(1977-),男,博士,主要从事容错计算、可信计算研究

Received date: 2010-06-07

  Revised date: 2010-09-27

  Online published: 2011-01-02

Supported by

重庆市自然科学基金资助项目(CSTC2008BB2307)

摘要

为了降低设置检查点的时间和空间开销,提出了一种两级检查点算法,其中组级采用协调检查点算法,系统级采用单阶段检查点算法.该算法基于分布式动态分组策略,通过发送分组来确保分组间不会产生孤儿消息,实现了由传统的两阶段提交算法到单阶段算法的转变.实验结果表明,算法执行时间较低,时间复杂度由通常的O(n2)降低到O(n),具有较强的实用性.

本文引用格式

刘国良 陈蜀宇 徐光侠 常光辉 . 于动态分组的两级检查点算法[J]. 华南理工大学学报(自然科学版), 2011 , 39(2) : 141 -147 . DOI: 10.3969/j.issn.1000-565X.2011.02.024

Abstract

In order to reduce the overhead of time and space for setting checkpoints,a two-level checkpoint algorithm is proposed,in which the cooperative checkpoint algorithm is adopted for the group level and the single-stage checkpoint algorithm is used for the system level.The algorithm,which is based on the distributed dynamic grou-ping,eliminates orphan messages by sender grouping and implements the change from the conventional two-stage submission algorithm to the single-stage one.Experimental results indicate that the proposed algorithm is of high practicability.The execution time of it is comparatively low and the time complexity for obtaining checkpoints reduces from O(n2) to O(n).

文章导航

/