DocumentCode
623752
Title
Coupling task progress for MapReduce resource-aware scheduling
Author
Jian Tan ; Xiaoqiao Meng ; Li Zhang
Author_Institution
IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
2013
fDate
14-19 April 2013
Firstpage
1618
Lastpage
1626
Abstract
Schedulers are critical in enhancing the performance of MapReduce/Hadoop in presence of multiple jobs with different characteristics and performance goals. Though current schedulers for Hadoop are quite successful, they still have room for improvement: map tasks (MapTasks) and reduce tasks (ReduceTasks) are not jointly optimized, albeit there is a strong dependence between them. This can cause job starvation and unfavorable data locality. In this paper, we design and implement a resource-aware scheduler for Hadoop. It couples the progresses of MapTasks and ReduceTasks, utilizing Wait Scheduling for ReduceTasks and Random Peeking Scheduling for MapTasks to jointly optimize the task placement. This mitigates the starvation problem and improves the overall data locality. Our extensive experiments demonstrate significant improvements in job response times.
Keywords
resource allocation; Hadoop; MapReduce resource-aware scheduling; MapTasks; ReduceTasks; coupling task progress; random peeking scheduling; task placement; wait scheduling; Couplings; Delays; Heart beat; Instruction sets; Processor scheduling; Synchronization; Time factors;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2013 Proceedings IEEE
Conference_Location
Turin
ISSN
0743-166X
Print_ISBN
978-1-4673-5944-3
Type
conf
DOI
10.1109/INFCOM.2013.6566958
Filename
6566958
Link To Document