Dynamic Processing Slots Scheduling for I/O Intensive Jobs of Hadoop MapReduce

Shiori Kurazumi, Tomoaki Tsumura, S. Saito, H. Matsuo
{"title":"Dynamic Processing Slots Scheduling for I/O Intensive Jobs of Hadoop MapReduce","authors":"Shiori Kurazumi, Tomoaki Tsumura, S. Saito, H. Matsuo","doi":"10.1109/ICNC.2012.53","DOIUrl":null,"url":null,"abstract":"Hadoop, consists of Hadoop MapReduce and Hadoop Distributed File System (HDFS), is a platform for large scale data and processing. Distributed processing has become common as the number of data has been increasing rapidly worldwide and the scale of processes has become larger, so that Hadoop has attracted many cloud computing enterprises and technology enthusiasts. Hadoop users are expanding under this situation. Our studies are to develop the faster of executing jobs originated by Hadoop. In this paper, we propose dynamic processing slots scheduling for I/O intensive jobs of Hadoop MapReduce focusing on I/O wait during execution of jobs. Assigning more tasks to added free slots when CPU resources with the high rate of I/O wait have been detected on each active Task Tracker node leads to the improvement of CPU performance. We implemented our method on Hadoop 1.0.3, which results in an improvement of up to about 23% in the execution time.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"196 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

Abstract

Hadoop, consists of Hadoop MapReduce and Hadoop Distributed File System (HDFS), is a platform for large scale data and processing. Distributed processing has become common as the number of data has been increasing rapidly worldwide and the scale of processes has become larger, so that Hadoop has attracted many cloud computing enterprises and technology enthusiasts. Hadoop users are expanding under this situation. Our studies are to develop the faster of executing jobs originated by Hadoop. In this paper, we propose dynamic processing slots scheduling for I/O intensive jobs of Hadoop MapReduce focusing on I/O wait during execution of jobs. Assigning more tasks to added free slots when CPU resources with the high rate of I/O wait have been detected on each active Task Tracker node leads to the improvement of CPU performance. We implemented our method on Hadoop 1.0.3, which results in an improvement of up to about 23% in the execution time.
Hadoop MapReduce I/O密集型任务的动态处理槽调度
Hadoop,由Hadoop MapReduce和Hadoop HDFS (Distributed File System)组成,是一个用于大规模数据处理的平台。随着全球范围内数据量的快速增长和进程规模的不断扩大,分布式处理变得越来越普遍,使得Hadoop吸引了众多云计算企业和技术爱好者。在这种情况下,Hadoop用户正在不断扩大。我们的研究是开发由Hadoop发起的更快的任务执行速度。本文针对Hadoop MapReduce的I/O密集型作业,提出了一种针对作业执行过程中I/O等待的动态处理槽调度方法。当每个活动Task Tracker节点上检测到高I/O等待率的CPU资源时,可以将更多的任务分配给增加的空闲插槽,从而提高CPU性能。我们在Hadoop 1.0.3上实现了我们的方法,结果在执行时间上提高了大约23%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信