• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (3): 52-57.

• 论文 • 上一篇    下一篇

面向MapReduce的自适应延迟调度算法

宁文瑜,吴庆波,谭郁松   

  1. (国防科学技术大学计算机学院,湖南 长沙 410073)
  • 收稿日期:2012-08-01 修回日期:2012-11-21 出版日期:2013-03-25 发布日期:2013-03-25
  • 基金资助:

    核高基项目资助项目(2012zx01040001)

MapReduce oriented selfadaptive delay scheduling algorithm

NING  Wenyu,WU Qingbo,TAN Yusong   

  1. (School of Computer Science,National University of Defense Technology,Changsha 410073,China)
  • Received:2012-08-01 Revised:2012-11-21 Online:2013-03-25 Published:2013-03-25

摘要:

MapReduce已经成为主流的海量数据处理模式,调度作为其中的关键环节已受到业界的广泛关注。但是,已有的调度算法难以达到公平性和数据本地性之间的平衡,提出一种动态自适应的延迟调度算法,针对公平延迟调度算法静态设置延迟时间的不足,根据节点的释放速度动态调整作业的延迟等待时间,避免了节点释放速度快时,作业因静态延迟时间而进行的无效等待,从而减少了完成整个作业的响应时间。通过对基于Hadoop平台实现的原型系统的文本排序实验测试表明,自适应的延迟调度算法相比已有的延迟调度算法在作业响应时间方面提升5%~8%。

关键词: 公平调度器, 自适应, 延迟调度, 数据本地性

Abstract:

MapReduce has become a mainstream mass data processing mode,As its crucial part, the scheduler has received extensive concerns of the industry.But existing scheduling algorithms cannothavea good balance between fairness and data locality.Therefore,in this paper, a selfadaptive delay scheduling algorithm is proposed in order to make up the shortage of statically setting waiting time in configuration file.It dynamically adjust waiting time according to the speed of free nodes,so it can reduce job response time.Based on the algorithm,a prototype is developed and experiments testing the algorithm's performance are carried out.The results show that the selfadaptive delay schedulingalgorithm outperforms previous delay scheduling ones in term of the job response time about 5%~8%.

Key words: fair scheduler;selfadaptive;delay scheduling;data locality