TY - GEN
T1 - Empirical Analysis of MapReduce Job Scheduling with respect to Energy Consumption of Clusters
AU - D'souza, Sofia
AU - Prema, K. V.
PY - 2019/8
Y1 - 2019/8
N2 - The growing popularity of Cloud Computing has led to an increasing number of applications using MapReduce in cloud data centers. MapReduce workloads are mostly interactive workloads or batch processing workloads that consume an enormous amount of energy when hosted on multiple clusters. Currently, the scheduling of workloads is done with the sole goal of the faster execution time of jobs. However, in doing so, there is wastage of energy as the same jobs could be completed within the stipulated Service Level Agreement (SLA) using fewer resources when hosted on small clusters. Therefore, in order to minimize the energy consumption of MapReduce clusters, workloads could be deployed on a minimum number of clusters depending on the type and size with the goal of minimizing energy consumption and not faster response time. In this work, the three schedulers i.e FIFO, Fair and Capacity schedulers are compared with respect to energy efficiency on small-scale and large-scale workloads. Experiments performed on a small cluster using these workloads show significant energy savings with respect to Capacity scheduler compared to other schedulers.
AB - The growing popularity of Cloud Computing has led to an increasing number of applications using MapReduce in cloud data centers. MapReduce workloads are mostly interactive workloads or batch processing workloads that consume an enormous amount of energy when hosted on multiple clusters. Currently, the scheduling of workloads is done with the sole goal of the faster execution time of jobs. However, in doing so, there is wastage of energy as the same jobs could be completed within the stipulated Service Level Agreement (SLA) using fewer resources when hosted on small clusters. Therefore, in order to minimize the energy consumption of MapReduce clusters, workloads could be deployed on a minimum number of clusters depending on the type and size with the goal of minimizing energy consumption and not faster response time. In this work, the three schedulers i.e FIFO, Fair and Capacity schedulers are compared with respect to energy efficiency on small-scale and large-scale workloads. Experiments performed on a small cluster using these workloads show significant energy savings with respect to Capacity scheduler compared to other schedulers.
UR - http://www.scopus.com/inward/record.url?scp=85081992800&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081992800&partnerID=8YFLogxK
U2 - 10.1109/DISCOVER47552.2019.9007941
DO - 10.1109/DISCOVER47552.2019.9007941
M3 - Conference contribution
T3 - 2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2019 - Proceedings
BT - 2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics, DISCOVER 2019
Y2 - 11 August 2019 through 12 August 2019
ER -