首页> 外文会议>2012 Third International Conference on Networking and Computing. >Dynamic Processing Slots Scheduling for I/O Intensive Jobs of Hadoop MapReduce
【24h】

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

机译:Hadoop MapReduce的I / O密集型作业的动态处理插槽调度

获取原文
获取原文并翻译 | 示例

摘要

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由Hadoop MapReduce和Hadoop分布式文件系统(HDFS)组成,是用于大规模数据和处理的平台。分布式处理已经变得很普遍,因为全球数据数量迅速增长,并且流程规模越来越大,因此Hadoop吸引了许多云计算企业和技术爱好者。在这种情况下,Hadoop用户正在扩展。我们的研究是为了更快地执行由Hadoop发起的作业。在本文中,我们提出了针对Hadoop MapReduce的I / O密集型作业的动态处理插槽调度,重点是作业执行期间的I / O等待。当在每个活动的Task Tracker节点上检测到具有高I / O等待率的CPU资源时,将更多任务分配给添加的空闲插槽将导致CPU性能的提高。我们在Hadoop 1.0.3上实现了我们的方法,这使执行时间提高了大约23%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号