期刊文献+

基于hadoop的时隙优化任务调度策略研究 被引量:2

A Research of Time Slot Optimization Task Scheduling Strategy Based on the Hadoop
下载PDF
导出
摘要 针对分布式云计算平台hadoop任务调度中由于网络时延而导致的调度不平衡问题,提出一种基于时隙优化的任务调度算法。充分参考当前网络条件,将其作为任务调度的重要参考依据,利用SDN对网络带宽的管理能力,根据时隙策略分配带宽,结合局部性原理决定将任务分派到本地还是低负载的其他节点,从全局角度保证任务本地化比例较高的前提下以最优的方式高效分派任务,以提高系统整体的任务处理能力。依据算法设计调度器设计并进行实验,实验结果验证了算法的调度质量。 In this paper, a task scheduling algorithm based on time slot optimization is putted forward to solve the problems of imbalance about the network time delay in scheduling in distributed task scheduling in the cloud com- puting platform hadoop. Referring to the current network conditions, this algorithm as an important reference in task scheduling. According to the strategy of the time slot to allocate bandwidth and using of SDN management ability of network bandwidth, combined with the principle of locality to task assignment whether in local or other nodes of low load, from the global perspective, ensure higher percentage localization task to task in the high efficiency, in the last, the ability to handle task of system as a whole is improved a lot. According to the algorithm to design the scheduler and experimental testing, the results verify the quality of scheduling algorithm.
作者 邓志龙 付明月 张琦玮 Deng Zhilong Fu Mingyue Zhang Qiwei(School of Electronics and Information, Northwestern Polytechnical University, Xi'an 710072, China School of Automation, Northwestern Polytechnical University, Xi'an 710072, China)
出处 《西北工业大学学报》 EI CAS CSCD 北大核心 2017年第1期32-37,共6页 Journal of Northwestern Polytechnical University
基金 国家自然科学基金(61471299)资助
关键词 云计算 HADOOP平台 SDN架构 任务调度 时隙策略 负载均衡 cloud computing hadoop platform SDN architecture task scheduling time slot strategy load balancing
  • 相关文献

参考文献1

二级参考文献25

  • 1Armbrust M, Fox A, Griffith R et al. A view of cloud computing. Communications of the ACM, 2010, 53(4): 50 58.
  • 2Patterson D, Brown A, BroadweIl P et al. Recovery oriented computing (ROC).. Motivation, definition, techniques, and case studies. Berkeley: UC Berkeley, Technical Report: UCB/CSD-02-1175 , 2002.
  • 3Clark C, Fraser K, Hand Set al. Live migration of virtual machines//Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI'05). Boston, 2005: 273-286.
  • 4Zhu X, Young D, Watson B.J, Wang Z et al. 1000 lslands: An integrated approach to resource management forvirtualized data centers. Cluster Computing, 2008, 12(1): 45-57.
  • 5Li Bo, Li Jian Xin, Huai Jin-Peng et al. EnaCloud: An energy saving application live placement approach for cloud computing environments//Proceedings of the International Conference on Cloud Computing. Bangalore, 2009:17-24.
  • 6Ajiro Y, Tanaka A. Improving packing algorithms for server consolidation//Proceedings of the 33rd International Computer Measurement Group Conference. San Diego, 2007:399-406.
  • 7Gupta R, Bose S. K, Sundarrajan Set al. A two stage heuristic algorithm for solving server consolidation problem with item-item and bin-item incompatibility constraints//Proceedings of the 2008 IEEE International Conference on Services Computing (SCC'08). Hawaii, 2008:39-46.
  • 8Agrawal S, Bose S K, Sundarrajan S. Grouping genetic algorithm for solving the server consolidation with conflicts// Proceedings of the 1st ACM/SIGEVO Summit Genetic and Evolutionary Computation. New York, 2009:1-8.
  • 9Wood T, Sbenoy P J, Venkataramani A. Black-box and gray-box strategies for virtual machine migration//Proceedings of the 4th USENIX Symposium on Networked Systems Design and Implementation (NSDI' 07). Cambridge, MA, 2007 : 229-242.
  • 10Coffman J, Garey M R, Johnson D S. Approximation algorithms for bin packing: A survey. Approximation algorithms for NP-Hard problems. Boston: PWS Publishing, 1997: 46 93.

共引文献121

同被引文献24

引证文献2

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部