Research of Three-Queue Scheduling Algorithms Based on Priority
Ding Qiu-lin · 2011
For solving the shortage of scheduling algorithms on the Hadoop platform,the paper proposed an improved scheduling algorithm-Triple-Queue algorithm.After taking full account of data locality,the Triple-Queue algorithm designs a improved computational model of priority,which can distinguish the user's job levels clearly and ensure a certain degree of fairness,so as to reduce the job execution time and avoid wasting system resources.The results of experiment show that the algorithm improves the efficiency significantly and solves the problem of data locality better with the increased amount of data.