| Checkpointing Scheme for Relevant Distributed Real-Time Tasks |
| |
| 作者姓名： | 方明 袁由光 杨升春 赵晓勇 |
| |
| 作者单位： | [1]Institute of Computer Science, Harbin Engineering University, Harbin 150001 [2]Wuhan Digital Engineering Institute, Wuhan 430074 [3]Center of Software Engineering, Three Gorges University, Yichang 443002 |
| |
| 摘 要： | IntroductionReal-ti me response and reliability are the mostconcerned characteristics for perfor ming distributed real-ti me tasks in a safety critical system. Generally , adistributed real-ti me scheduling is adopted to ensure thereal-ti me response first , and fault-tolerant method ofresource redundancy is needed then.For transient faults in the certain occurrence andrecovery rates ,this paper studies the fault-tolerant methodbased on the static scheduling for distributed real-ti metasks . T…
|
| 关 键 词： | 分布式实时任务 检查点图 有向非循环图 图论 |
| 收稿时间： | 2005-06-01 |
Checkpointing Scheme for Relevant Distributed Real-Time Tasks |
| |
| FANG Ming,YUAN You-guang,YANG Sheng-chun,ZHAO Xiao-yong.Checkpointing Scheme for Relevant Distributed Real-Time Tasks[J].Journal of Donghua University,2005,22(3):23-27. |
| |
| Authors: | FANG Ming YUAN You-guang YANG Sheng-chun ZHAO Xiao-yong |
| |
| Abstract: | 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. |
| |
| Keywords: | Checkpoint task scheduling DAG scheduled clusters tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
