Abstract
The original task scheduling algorithm of Hadoop cannot meet the performance requirements of heterogeneous clusters. According to the dynamic change of load of each task node and the difference of node performance of different tasks in the heterogeneous Hadoop cluster, a novel adaptive task scheduling strategy based on dynamic workload adjustment (ATSDWA) is presented. With ATSDWA, tasktrackers can adapt to the change of load at runtime, obtain tasks in accordance with the computing ability of their own, and realize the self-regulation, while avoiding the complexity of algorithm, which is the prime reason to make jobtracker the system performance bottleneck. Experimental results show that ATSDWA is a highly efficient and reliable algorithm, which can make heterogeneous Hadoop clusters stable, scalable, efficient, and load balancing. Furthermore, its performance is superior to the original and improved task scheduling strategy of Hadoop, from the aspects of the execution time of tasks, the resource utilization, and the speed-up ratio.
Original language | English |
---|---|
Article number | 6832443 |
Pages (from-to) | 471-482 |
Number of pages | 12 |
Journal | IEEE Systems Journal |
Volume | 10 |
Issue number | 2 |
DOIs | |
Publication status | Published - Jun 2016 |
Externally published | Yes |
Keywords
- Adaptive scheduling
- clustering methods
- computational efficiency
- distributed computing
- dynamic scheduling