DocumentCode :
3394726
Title :
New improvement of the Hadoop relevant data locality scheduling algorithm based on LATE
Author :
Liying Li ; Zhuo Tang ; Renfa Li ; Liu Yang
Author_Institution :
Coll. of Inf. Sci. & Eng., Hunan Univ., Changsha, China
fYear :
2011
fDate :
19-22 Aug. 2011
Firstpage :
1419
Lastpage :
1422
Abstract :
In the present, scheduling problem is a hot Cloud Computation research issues, the purpose is to coordinate the Cloud Computation resources to be fully rational use. Data locality is one of the main properties in the particular cloud platform for Hadoop. The paper discussed the property , proposed a new improvement of the Hadoop relevant data locality scheduling algorithm based on LATE. The algorithm mainly soved the bakeup of slow task performance problem which bring during the implementation of data read take most of the time and envently influence its processing speed. Finally, carried on experiment to the algorithm and analyzed the funcation, verified the algorithm to improve the response time and the whole system throughput.
Keywords :
cloud computing; scheduling; software performance evaluation; Hadoop relevant data locality scheduling algorithm; LATE; cloud computation research issues; system throughput; task performance problem; Algorithm design and analysis; Clustering algorithms; Computers; Processor scheduling; Scheduling; Throughput; Time factors; Date Locality; Hadoop; LATE; MapReduce;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronic Science, Electric Engineering and Computer (MEC), 2011 International Conference on
Conference_Location :
Jilin
Print_ISBN :
978-1-61284-719-1
Type :
conf
DOI :
10.1109/MEC.2011.6025737
Filename :
6025737
Link To Document :
بازگشت