期刊
PARALLEL COMPUTING
卷 39, 期 10, 页码 567-585出版社
ELSEVIER
DOI: 10.1016/j.parco.2013.06.003
关键词
Workflow Scheduling; Reliability; Redundancy; Heterogeneous systems
资金
- Nature Science Foundation of China [61100194]
- Scientific Research Fund of Zhejiang Provincial Education Department [Y201120356]
- Innovation Fund of Tianjin University [2013XQ-0061]
- key projects in the Science and Technology Pillar Program of Tianjin [11ZCKFGX01200]
We examine the problem of reliable workflow scheduling with less resource redundancy. As scheduling workflow applications in heterogeneous systems, either for optimizing the reliability or for minimizing the makespan, are NP-Complete problems, we alternatively find schedules for meeting specific reliability and deadline requirements. First, we analyze the reliability of a given schedule using two important definitions: Accumulated Processor Reliability (APR) and Accumulated Communication Reliability (ACR). Second, inspired by the reliability analysis, we present three scheduling algorithms: RR algorithm schedules least Resources to meet the Reliability requirement; DRR algorithm extends RR by further considering the Deadline requirement; and dynamic algorithm schedules tasks dynamically: It avoids the Chain effect caused by uncertainties on the task execution time estimates, and relieves the impact from the inaccuracy on failure estimation. Finally, the empirical evaluation shows that our algorithms can save a significant amount of computation and communication resources when performing a similar reliability compared to Fault-Tolerant-Scheduling-Algorithm (FTSA) algorithm. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据