Green Scheduling: A Scheduling Policy for Improving the Energy Efficiency of Fair Scheduler

Tao Zhu, Chengchun Shu, Haiyan Yu
{"title":"Green Scheduling: A Scheduling Policy for Improving the Energy Efficiency of Fair Scheduler","authors":"Tao Zhu, Chengchun Shu, Haiyan Yu","doi":"10.1109/PDCAT.2011.42","DOIUrl":null,"url":null,"abstract":"Energy efficiency of data centers has draw a great attention due to the cost of power consumption increases dramatically as the size of data center grows. Nowadays, Map Reduce is a framework widely used for processing large data sets in data center, its energy efficiency directly affects the energy efficiency of data center. MapReduce's energy efficiency is closely tied to its scheduler, we find that fair scheduler outperforms FIFO scheduler in energy efficiency when CPU-intensive job and IO-intensive job running simultaneously on the cluster, because fair scheduler achieves better resource utilization by overlapping resource complementary tasks on slaves. However this behavior is occasional, because fair scheduler has no information about task's resource requirement. This occasional behavior lets us identify the area that energy efficiency of fair scheduler can be improved. We propose an energy-efficient scheduling policy called green scheduling which relaxes fairness slightly to create as many opportunities as possible for overlapping resource complementary tasks. The results show that green scheduling can save between 7% and 9% energy consumption of fair scheduler.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2011.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Energy efficiency of data centers has draw a great attention due to the cost of power consumption increases dramatically as the size of data center grows. Nowadays, Map Reduce is a framework widely used for processing large data sets in data center, its energy efficiency directly affects the energy efficiency of data center. MapReduce's energy efficiency is closely tied to its scheduler, we find that fair scheduler outperforms FIFO scheduler in energy efficiency when CPU-intensive job and IO-intensive job running simultaneously on the cluster, because fair scheduler achieves better resource utilization by overlapping resource complementary tasks on slaves. However this behavior is occasional, because fair scheduler has no information about task's resource requirement. This occasional behavior lets us identify the area that energy efficiency of fair scheduler can be improved. We propose an energy-efficient scheduling policy called green scheduling which relaxes fairness slightly to create as many opportunities as possible for overlapping resource complementary tasks. The results show that green scheduling can save between 7% and 9% energy consumption of fair scheduler.
绿色调度:提高公平调度器能效的调度策略
随着数据中心规模的不断扩大,数据中心的能源消耗成本也在急剧增加,因此数据中心的能源效率备受关注。Map Reduce是目前广泛应用于数据中心处理大型数据集的框架,其能效直接影响到数据中心的能效。MapReduce的能源效率与其调度程序密切相关,我们发现当cpu密集型作业和io密集型作业同时在集群上运行时,公平调度程序在能源效率上优于FIFO调度程序,因为公平调度程序通过在slave上重叠资源互补任务来实现更好的资源利用率。然而,这种行为是偶然的,因为公平调度程序没有关于任务资源需求的信息。这种偶然的行为让我们确定公平调度程序的能源效率可以改进的领域。我们提出了一种节能调度策略,称为绿色调度,它稍微放宽公平性,为重叠的资源互补任务创造尽可能多的机会。结果表明,绿色调度可节省公平调度程序7% ~ 9%的能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信