论文信息 - Research on Information Processing with Delay Fair Scheduling Algorithm Based on Resource Situation

Research on Information Processing with Delay Fair Scheduling Algorithm Based on Resource Situation

Job scheduling algorithm is one of the key technologies Hadoop platform. In this paper, waiting for a fair scheduling algorithm based on delay resource situation. The algorithm periodically obtain status through the use of cluster resources to determine the wait timeout, it has dynamic. Experimental results show that the Delay Fair Scheduling Algorithm Based On the Resource Situation than the original algorithm to some extent reduces the job run time and improve the throughput of Hadoop platform.

Yang Yang | Di Jing | Xue Ying Jiang

[1] Liu Yang,et al. New improvement of the Hadoop relevant data locality scheduling algorithm based on LATE , 2011, 2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC).

[2] Todd Plantenga,et al. Using Performance Measurements to Improve MapReduce Algorithms , 2012, ICCS.

[3] Sadika Amreen,et al. Detecting document similarity in large document collecting using MapReduce and the Hadoop framework , 2012 .