DocumentCode :
1736094
Title :
Study on re-implement mechanism based on node-ability in Hadoop
Author :
Wang, Yaohui ; Yang, Tao
Author_Institution :
Sch. of Inf. Eng., Northeast Dianli Univ., Jilin, China
Volume :
2
fYear :
2011
Firstpage :
1220
Lastpage :
1223
Abstract :
Face to massive web log data, single log analysis has been unable to meet people´s pursuit of high efficiency, the traditional log analysis based on Hadoop has some drawbacks in resource utilization, etc. Therefore, based on traditional Hadoop task scheduler, a new tasks pre-scheduling mechanism based on node-ability is proposed, the size of the task block is determined according to the ability of each processing node. Thus, the conflicts between job execution time and system resource utilization is balanced, which can protect the jobs of the response time and effective enforcement mechanism to reduce the weight of the additional overhead and improve overall resource utilization.
Keywords :
Internet; distributed processing; resource allocation; scheduling; Hadoop; Hadoop task scheduler; job execution time; massive Web log data; node-ability; reimplement mechanism; single log analysis; system resource utilization; tasks prescheduling mechanism; Hadoop; scheduler mechanism; web log analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Network Technology (ICCSNT), 2011 International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4577-1586-0
Type :
conf
DOI :
10.1109/ICCSNT.2011.6182179
Filename :
6182179
Link To Document :
بازگشت