返回
Reliability-aware scheduling strategy for heterogeneous distributed computing systems
DOI:10.1016/j.jpdc.2010.05.002.png)
摘要
En 中文
Heterogeneous computing systems are promising computing platforms, since single parallel architecture based systems may not be sufficient to exploit the available parallelism with the running applications. In some cases, heterogeneous distributed computing (HDC) systems can achieve higher performance with lower cost than single-machine supersystems. However, in HDC systems, processors and networks are not failure free and any kind of failure may be critical to the running applications. One way of dealing with such failures is to employ a reliable scheduling algorithm. Unfortunately, most existing scheduling algorithms for precedence constrained tasks in HDC systems do not adequately consider reliability requirements of inter-dependent tasks. In this paper, we design a reliability-driven scheduling architecture that can effectively measure system reliability, based on an optimal reliability communication path search algorithm, and then we introduce reliability priority rank (RRank) to estimate the task's priority by considering reliability overheads. Furthermore, based on directed acyclic graph (DAG) we propose a reliability-aware scheduling algorithm for precedence constrained tasks, which can achieve high quality of reliability for applications. The comparison studies, based on both randomly generated graphs and the graphs of some real applications, show that our scheduling algorithm outperforms the existing scheduling algorithms in terms of makespan, scheduling length ratio, and reliability. At the same time, the improvement gained by our algorithm increases as the data communication among tasks increases. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Heterogeneous distributed systems
Scheduling algorithm
Reliability
Duplication
Precedence constrained tasks
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Modification of cellulose model surfaces by cationic polymer latexes prepared by RAFT-mediated surfactant-free emulsion polymerization
Polym. Chem.
IF0
An optimal scheduling algorithm for minimizing the computing period of cyclic synchronous tasks on multiprocessors最小化多处理器上循环同步任务计算周期的最佳调度算法

