Dynamic Processing Slots Scheduling for I/O Intensive Jobs of Hadoop MapReduce
Dynamic Processing Slots Scheduling for I/O Intensive Jobs of Hadoop MapReduce
复制标题
DOI:
10.1109/icnc.2012.53
复制
发表时间:
2012-12
期刊:
影响因子:
--
通讯作者:
Shiori Kurazumi;Tomoaki Tsumura;S. Saito;H. Matsuo
中科院分区:
文献类型:
--
作者:
Shiori Kurazumi;Tomoaki Tsumura;S. Saito;H. Matsuo
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.