Checkpointing Scheme for Relevant Distributed Real-Time Tasks  

作　　者：方明 袁由光 杨升春 赵晓勇 

机构地区：[1]Institute of Computer Science,Harbin Engineering University, Harbin 150001,Wuhan Digital Engineering Institute,Wuhan 430074 [2]Wuhan Digital Engineering Institute,Wuhan 430074 [3]Center of Software Engineering,Three Gorges University,Yichang 443002

出　　处：《Journal of Donghua University(English Edition)》2005年第3期23-27,共5页东华大学学报（英文版）

摘　　要：A checkpointing scheme for relevant distributed real-time tasks which can be scheduled as a DAG is proposed. A typical algorithm, OSA, is selected for DAG scheduling. A new methods based a new structure, Scheduled Cluster Tree, is presented to calculate the slack time of each task in the task cluster. In the checkpointing scheme, the optimal checkpoint intervals which minimize the approximated failure probability are derived formally and validated experimentally. The complexity of approximated failure probability is quite small compared with that of the exact probability. Meanwhile, the consistency of the checkpointing is discussed also.A checkpointing scheme for relevant distributed real-time tasks which can be scheduled as a DAG is proposed. A typical algorithm, OSA, is selected for DAG scheduling. A new methods based a new structure, Scheduled Cluster Tree, is presented to calculate the slack time of each task in the task cluster. In the checkpointing scheme, the optimal checkpoint intervals which minimize the approximated failure probability are derived formally and validated experimentally. The complexity of approximated failure probability is quite small compared with that of the exact probability. Meanwhile, the consistency of the checkpionting is discussed also.

关 键 词：CHECKPOINT task scheduling DAG scheduled clusters tree 

分 类 号：O157.5[理学—数学]