Journal
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
Volume 17, Issue 4, Pages 1413-1425Publisher
SPRINGER
DOI: 10.1007/s10586-014-0372-1
Keywords
Reliability analysis; Heterogeneous cluster systems; Scheduling algorithm; Duplication; Weibull distribution
Funding
- National Science Foundation of China [61133005, 61070057, 61370098]
- National Science Foundation for Distinguished Young Scholars of Hunan [12JJ1011]
- Scientific Research Fund of Hunan Provincial Education Department [12A062]
Ask authors/readers for more resources
In large-scale heterogeneous cluster computing systems, processor and network failures are inevitable and can have an adverse effect on applications executing on such systems. One way of taking failures into account is to employ a reliable scheduling algorithm. However, most existing scheduling algorithms for precedence constrained tasks in heterogeneous systems only consider scheduling length, and not efficiently satisfy the reliability requirements of task. In recognition of this problem, we build an application reliability analysis model based on Weibull distribution, which can dynamically measure the reliability of task executing on heterogeneous cluster with arbitrary networks architectures. Then, we propose a reliability-driven earliest finish time with duplication scheduling algorithm (REFTD) which incorporates task reliability overhead into scheduling. Furthermore, to improve system reliability, it duplicates task as if task hazard rate is more than threshold . The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm can shorten schedule length and improve system reliability significantly.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available