期刊文献+

采用资源划分的云环境下Hadoop资源许可调度方法 被引量:1

A Resource License Scheduling Method for Hadoop in Cloud Computing Using Resource Allocation
下载PDF
导出
摘要 针对云计算环境中Hadoop平台由于节点计算能力差异、多样混合负载共存等原因而出现的性能不佳的问题,提出一种采用资源划分的资源许可方法。该方法在云计算环境下通过减少资源浪费或负载过重等情况的出现来提高系统性能。该方法采集资源信息并推测任务资源需求,根据可用计算资源和任务需求动态划分、调度资源;使用与资源无耦合的资源许可启动任务并控制任务数量调节资源利用率以适应云环境。使用该方法对比公平调度器在国家高性能计算中心(西安)进行测试发现:单作业在资源竞争环境中优于公平调度器的静态结果;混合负载在3种测试环境中完成时间分别平均减少了27.5%、37.1%和50.98%,性能显著提升。实验结果表明,该方法可以适应负载资源需求和可用计算资源的变化,灵活划分计算资源,解决Hadoop在云环境中的性能不佳问题。 A resource license scheduling method using resource allocation is proposed to improve the poor performance caused by different computing capacities of nodes and mixed workload in cloud computing. The method improves the performance through reducing the resources wasting or overload. It collects resource information and estimates resource requirements of workloads and allocates computing resources dynamically according to available resources and resource requirements of workloads. Licenses uncoupled with resources are used to launch tasks and to adjust the number of parallel tasks to adapt the cloud environment by controlling the number of licenses. The method is evaluated in the national high performance computing center (Xi'an). Results show that the completion times of single job workloads of the proposed method are better than those of the FAIR scheduler in competitive environments. Moreover, the completion times of mixed workloads of the method in three environments reduce 27.5%, 37. 1% and 50.98% respectively on average, that is, the performance of the method has a significant improvement. It can be concluded from the results that the proposed method adapts the complex environment and solve the performance problem in cloud computing.
出处 《西安交通大学学报》 EI CAS CSCD 北大核心 2015年第8期69-74,108,共7页 Journal of Xi'an Jiaotong University
基金 国家自然科学基金资助项目(61173039) 国家自然科学基金青年基金资助项目(61202041) 国家高技术研究发展计划资助项目(2012AA01A306) 深圳市科技计划资助项目(JCYJ20120615101127404)
关键词 云计算 HADOOP 资源划分 作业调度 混合负载 cloud computing Hadoop resource allocation job scheduling mixed workload
  • 引文网络
  • 相关文献

参考文献12

  • 1REISS C, TUMANOV A, GANGER G R, et al. Heterogeneity and dynamicity of clouds at scale: google trace analysis [C] // Proceedings of the Third ACM Symposium on Cloud Computing. New York, USA.. ACM, 2012: 7.
  • 2DEAN J, GHEMAWAT S. MapReduce: simplified data processing on large clusters [J]. Communications of the ACM, 2008, 51(1).. 107-113.
  • 3李建江,崔健,王聃,严林,黄义双.MapReduce并行编程模型研究综述[J].电子学报,2011,39(11):2635-2642. 被引量:187
  • 4ZAHARIA M, BORTHAKUR D, SARMA J S, et al. Job scheduling for multi-user MapReduce clusters, UCB/EECS-2009-55 [R]. Berkeley, CA, USA: Uni- versity of California. EECS Department, 2009.
  • 5YANG Hailong, LUAN Zhongzhi, LI Wenjun, et al. MapReduce workload modeling with statistical ap- proach [J]. Journal of Grid Computing, 2012, 10(2) ..279-310.
  • 6HUANG Shengsheng, HUANG Jie, DAI Jinquan, et al. The HiBench benchmark suite: characterization of the MapReduce-based data analysis [C] ff Proceedings of the 2010 IEEE 26th International Conference on Da- ta Engineering Workshops. Berlin, Germany: Spring- er, 2010: 41-51.
  • 7ZAHARIA M, KONWINSKI A, JOSEPH A D, et al. Improving MapReduce performance in heterogene- ous environments [C] ff Proceedings of the 8th USE- NIX Conference on Operating Systems Design and Im- plementation. Berkeley, CA, USA: USENIX, 2008.. 29-42.
  • 8KWON Y C, BALAZINSKA M, HOWE B, et al. Skewtune: mitigating skew in MapReduce applications [C]ffProceedings of the 2012 ACM SIGMOD Interna- tional Conference on Management of Data. New York, USA ACM, 2012: 25-36.
  • 9RASOOLI A, DOWN D G. A hybrid scheduling ap- proach for scalable heterogeneous Hadoop systems [C]ffProceedings of the 2012 SC Companion on High Per- formance Computing, Networking, Storage and Anal- ysis. Piseataway, NJ, USA: IEEE, 2012: 1284- 1291.
  • 10TIAN Chao, ZHOU Haojie, HE Yongqiang, et al. A dynamic MapReduce scheduler for heterogeneous workloads [C]//Proceedings of the 2009 8th Interna- tional Conference on Grid and Cloud Computing. Pis- cataway, NJ, USA: IEEE, 2009: 218-224.

二级参考文献45

  • 1宁焕生,张瑜,刘芳丽,刘文明,渠慎丰.中国物联网信息服务系统研究[J].电子学报,2006,34(B12):2514-2517. 被引量:151
  • 2J Dean,S Ghemawat.MapReduce:Simplified data processing on large clusters[J].Communications of the ACM,2008,51(1):107-113.
  • 3J L Wagener.High performance fortran[J].Computer Standards & Interfaces,Elsevier,1996,18(4):371-377.
  • 4W Gropp,E Lusk,et al.Using MPI:Portable Parallel Programming with the Message Passing Interface[M].Cambridge:MIT Press,1999.1-350.
  • 5A Geist,A Beguelin,et al.PVM:Parallel Virtual Machine:A Users' Guide and Tutorial for Networked Parallel Computing[M].Cambridge:MIT Press,1995.1-299.
  • 6A Verma,N Zea,et al.Breaking the mapreduce stage barrier .Proc of IEEE International Conference on Cluster Computing .Los Alamitos:IEEE Computer Society,2010.235-244.
  • 7H C Yang,A Dasdan,et al.Map-Reduce-Merge:Simplified relational data processing .Proc of ACM SIGMOD International Conference on Management of Data .New York:ACM,2007.1029-1040.
  • 8S V Valvag,D Johansen.Oivos:Simple and efficient distributed data processing .Proc of IEEE International Conference on High Performance Computing and Communications .Piscataway:IEEE,2008.113-122.
  • 9Z Vrba,P Halvorsen,et al.Kahn process networks are a flexible alternative to mapreduce .Proc of IEEE International Conference on High Performance Computing and Communications .Piscataway:IEEE,2009.154-162.
  • 10Apache hadoop .http://lucene.apache.org/hadoop/,2010-10-15/2010-12-28.

共引文献186

同被引文献14

  • 1李千目,张晟骁,陆路,戚湧,张宏.一种Hadoop平台下的调度算法及混合调度策略[J].计算机研究与发展,2013,50(S1):361-368. 被引量:12
  • 2王丽,王晓凯.一种非线性改变惯性权重的粒子群算法[J].计算机工程与应用,2007,43(4):47-48. 被引量:60
  • 3胡建秀,曾建潮.微粒群算法中惯性权重的调整策略[J].计算机工程,2007,33(11):193-195. 被引量:62
  • 4李会荣,高岳林,李济民.一种非线性递减惯性权重策略的粒子群优化算法[J].商洛学院学报,2007,21(4):16-20. 被引量:24
  • 5Arfeen M A, Pawlikowski K, WiUig A. A framework for re- source allocation strategies in cloud computing environment [ C ]//Proc of IEEE 35th annual computer software and appli- cations conference. [ s. l. ] :IEEE ,2011:261-266.
  • 6Zhao Chenhong, Zhang Shanshan, Liu Qingfeng, et al. Inde- pendent tasks scheduling based on genetic algorithm in cloud computing[ C]//Proc of IEEE 5th international conference on wireless , networking and mobile computing Beijing:IEEE ,2009 : 1-4.
  • 7Guo Lizheng,Zhao Shuguang, Shen Shigen, et al. Task schedu- ling optimization in cloud computing based on heuristic algo- rithm [ J ]. Journal of Networks ,2012,7 (3) :547-553.
  • 8Li Jianfeng, Peng Jian, Cao Xiaoyang, et al. A task scheduling algorithm based on improved ant colony optimization in cloud computing environment[ J]. Energy Procedia ,2011 ( 13 ) :6833 -6840.
  • 9Dean J, Ghemawat S. MapReduce: simplified data processing on large clusters [ C ]//Proceedings of the 6th symposium on operating system design and implementation. New York:ACM, 2004:137-150.
  • 10Kennedy J, Eberhart R C. Particle swarm optimization[ C ]// Proc of IEEE international conference on neural networks. Pis- cataway, NJ: IEEE Service Center, 1995 : 1942-1948.

引证文献1

二级引证文献3

;
使用帮助 返回顶部