J4 ›› 2013, Vol. 35 ›› Issue (10): 125-130.
• 论文 • Previous Articles Next Articles
YANG Hao,TENG Fei,LI Tianrui,LI Zhao
Received:
Revised:
Online:
Published:
Abstract:
As an open source platform of cloud computing, Hadoop is widely used in many fields, such as natural language processing, machine learning and largescale image processing. With the increase of the types of cloud services, the realtime requirement is strengthened by cloud users. Most existing schedulers are designed to shorten the response time which cannot guarantee a specific deadline. Least Sparetime Scheduler (LSS) is designed and implemented to improve the performance of hard realtime jobs in Hadoop. The spare time is estimated dynamically and the LSS updates the job priority of the job queue in realtime. Experimental results show that the LSS can improve the success ratio of the cluster dealing with hard realtime jobs.
Key words: Hadoop;realtime jobs;scheduling;spare time
YANG Hao,TENG Fei,LI Tianrui,LI Zhao. Design and implementation of a least spare time scheduler for Hadoop [J]. J4, 2013, 35(10): 125-130.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2013/V35/I10/125