首页 | 本学科首页   官方微博 | 高级检索  
     

基于节点识别的慢任务调度算法
引用本文:崔云飞,李新明,李 艺,刘 东.基于节点识别的慢任务调度算法[J].通信学报,2014,35(7):15-128.
作者姓名:崔云飞  李新明  李 艺  刘 东
作者单位:1. 北京航天飞行控制中心,北京 100094;2. 装备学院 复杂电子系统仿真重点实验室,北京 101416
基金项目:国家自然科学基金资助项目(60904082);国家重大科技专项基金项目(2012ZX01045003-001)
摘    要:为了降低大数据处理集群在执行任务过程中的慢任务对作业执行效率的影响,提出了一种识别慢任务、备份慢任务、减少慢任务相结合的调度算法——TQST算法。首先,通过判断节点能力和任务执行时间,建立慢节点、非常慢节点和慢任务队列;其次,根据预判备份执行价值确定如何启动慢任务的备份任务,提高了备份执行的作用;然后,在节点识别的基础上,规避为非常慢节点分配任务,从根本上减少慢任务的产生,提高作业执行效率。实验结果表明,TQST算法在作业响应时间等方面优于已有的慢任务调度算法。

关 键 词:大数据  慢任务  备份任务  Map-Reduce
收稿时间:3/1/2013 12:00:00 AM

Slow task scheduling algorithm based on node identification
Yun-fei CUI,Xin-ming LI,Yi LI,Dong LIU.Slow task scheduling algorithm based on node identification[J].Journal on Communications,2014,35(7):15-128.
Authors:Yun-fei CUI  Xin-ming LI  Yi LI  Dong LIU
Affiliation:1. Beijing Aerospace Control Center, Beijing 100094, China;2. National Key Laboratory of Complex Electronic System Simulation, Academy of Equipment, Beijing 101416, China
Abstract:In order to reduce the influence of the slow task, produced in big data processing,a recognition slow task, speculative slow task, reduce the combination of slow task scheduling algorithm (TQST)was proposed. First of all, through the judgment of node ability and task execution time, slow node queue, very slow node queue and slow task queue were established; Secondly, according to the anticipation speculative execution value to decide how to start speculative task; Then, in the basis of node identification, avoid distributing tasks to very slow node, radically reduce slow task production, improve job execution efficiency. The experimental results show that TQST algorithm previous existing slow task scheduling algorithm in term of the job response time.
Keywords:big data  slow task  speculative task  Map-Reduce
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号