Empirical Analysis of MapReduce Job Scheduling with respect to Energy Consumption of Clusters

Sofia D'souza, P. V.
{"title":"Empirical Analysis of MapReduce Job Scheduling with respect to Energy Consumption of Clusters","authors":"Sofia D'souza, P. V.","doi":"10.1109/DISCOVER47552.2019.9007941","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":274260,"journal":{"name":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DISCOVER47552.2019.9007941","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

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.
基于集群能耗的MapReduce作业调度实证分析
云计算的日益普及导致越来越多的应用程序在云数据中心使用MapReduce。MapReduce的工作负载主要是交互工作负载或批处理工作负载,当托管在多个集群上时,这些工作负载会消耗大量的能量。目前,工作负载调度的唯一目标是加快作业的执行时间。但是,这样做会浪费能源,因为当托管在小型集群上时,相同的作业可以在规定的服务水平协议(SLA)内使用更少的资源完成。因此,为了最小化MapReduce集群的能耗,可以根据类型和大小将工作负载部署在最少数量的集群上,目标是最小化能耗,而不是更快的响应时间。在这项工作中,三种调度器即FIFO, Fair和Capacity调度器在小规模和大规模工作负载上的能源效率进行了比较。在使用这些工作负载的小型集群上进行的实验表明,与其他调度器相比,Capacity调度器可以显著节省能源。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信