Deadline-aware MapReduce job scheduling with dynamic resource availability

D Cheng, X Zhou, Y Xu, L Liu… - IEEE transactions on …, 2018 - ieeexplore.ieee.org
D Cheng, X Zhou, Y Xu, L Liu, C Jiang
IEEE transactions on parallel and distributed systems, 2018ieeexplore.ieee.org
As MapReduce is becoming ubiquitous in large-scale data analysis, many recent studies
have shown that the performance of MapReduce could be improved by different job
scheduling approaches, eg, Fair Scheduler and Capacity Scheduler. However, most exiting
MapReduce job schedulers focus on the scenario that MapReduce cluster is stable and pay
little attention to the MapReduce cluster with dynamic resource availability. In fact,
MapReduce cluster resources may fluctuate as there is a growing number of Hadoop …
As MapReduce is becoming ubiquitous in large-scale data analysis, many recent studies have shown that the performance of MapReduce could be improved by different job scheduling approaches, e.g., Fair Scheduler and Capacity Scheduler. However, most exiting MapReduce job schedulers focus on the scenario that MapReduce cluster is stable and pay little attention to the MapReduce cluster with dynamic resource availability. In fact, MapReduce cluster resources may fluctuate as there is a growing number of Hadoop clusters deployed on hybrid systems, e.g., infrastructure powered by mix of traditional and renewable energy, and cloud platforms hosting heterogeneous workloads. Thus, there is a growing need for providing predictable services to users who have strict requirements on job completion times in such dynamic environments. In this paper, we propose, RDS, a Resource and Deadline-aware Hadoop job Scheduler that takes future resource availability into consideration when minimizing job deadline misses. We formulate the job scheduling problem as an online optimization problem and solve it using an efficient receding horizon control algorithm. To aid the control, we design a self-learning model to estimate job completion times. We further extend the design of RDS scheduler to support flexible performance goals in various dynamic clusters. In particular, we use flexible deadline time bounds instead of the single fixed job completion deadline. We have implemented RDS in the open-source Hadoop implementation and performed evaluations with various benchmark workloads. Experimental results show that RDS substantially reduces the penalty of deadline misses by at least 36 and 10 percent compared with Fair Scheduler and Earliest Deadline First (EDF) scheduler, respectively. In a Hadoop cluster running partially on renewable energy, the experimental result shows the green power based resource prediction approach can further reduce the penalty of deadline misses by 16 percent compared to Auto-Regressive Integrated Moving Average (ARIMA) prediction approach.
ieeexplore.ieee.org