Earticle

초록

영어

With Hadoop been widely used, job scheduling technology, as a key technology in Hadoop, has been developed rapidly. However, Hadoop's default scheduling algorithm Fair Scheduler when performing the task scheduler does not consider load balancing status of each node cluster system, leading to low efficiency great job. For defect fair share scheduling algorithm, and combined LATE scheduling algorithm, load balancing scheduling algorithm based on a fair share. Experimental results show that the fair share scheduling algorithm can be improved in the scheduling task when taking into account the situation of each node load balancing, improve the efficiency of large jobs.

목차

Abstract
 1. Introduction
 2. Improvement Strategy
  2.1. Math Model
  2.2. Algorithm Flow Chart
  2.3. Pseudo Code of the Algorithm
 3. Experiment Results and Analysis
 4. Conclusion
 References

키워드

저자

• Shengjun Xue [ School of Computer and Software, Nanjing University of Information Science&Technology, Jiangsu Engineering Center of Network Monitoring, Nanjing, China ]
• Zhengwei Chen [ School of Computer and Software, Nanjing University of Information Science&Technology, Jiangsu Engineering Center of Network Monitoring, Nanjing, China ]
• Jingyi Chen [ School of Computer and Software, Nanjing University of Information Science&Technology, Jiangsu Engineering Center of Network Monitoring, Nanjing, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605