期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种满足任务主/次需求的云计算资源划分算法

An Algorithm of Partitioning Cloud Computing Resources to Meet Primary and Secondary Requirements of Tasks
下载PDF
导出
摘要 云计算平台中存在大量的异构资源,当云用户将任务提交给云平台,云调度系统搜索与这些任务需求相匹配的资源时,有可能没有任何资源节点能满足任务的需求,因此需要对这些异构资源进行聚类划分,满足任务的需求。根据实际情况,不妨假设云任务对云资源有主/次需求。文章给出云资源分簇计算能力的定义以及资源均衡划分概念,设计了随机近似和增强内聚性的云资源均衡划分算法。最后,通过模拟实验对算法的有效性进行分析。 There are a large number of heterogeneous resources in cloud computing platform,but when the cloud users submit tasks to the cloud platform and cloud scheduling system searches for resources to match the needs of these tasks.There may be not any resource node can meet the needs of the task,so we need to cluster these heterogeneous resources to meet the needs of the task.According to the actual situation,it may be assumed that cloud tasks have primary and secondary requirements for cloud resources.In this paper,the definition of computing power of resource cluster and the concept of resources equalization partitioning are given.The stochastic approximate algorithm of equally partitioning cloud resources and algorithm of equally partitioning cloud resources to enhance the cohesion are designed.Finally,the effectiveness of the algorithm is analyzed through simulation.
作者 秦小云 曾国荪
机构地区 同济大学计算机科学与技术系 国家高性能计算机工程技术中心同济分中心
出处 《计算机与数字工程》 2012年第10期1-4,75,共5页 Computer & Digital Engineering
基金 863项目(2009AA012201) 国家自然基金项目(61103068) NSFC-微软亚洲研究院联合资助项目(60970155) 教育部网络时代的科技论文快速共享专项研究课题(20110740001) 教育部博士点基金项目(20090072110035) 上海市优秀学科带头人计划项目(10XD1404400)资助
关键词 云计算 任务需求 资源选择 划分算法 cloud computing task requirements resources selecting partitioning algorithm
分类号 TP338 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献9

  • 1B. Hendrickson, R. Leland. An improved spectral graph par- titioning algorithm for mapping parallel computations[J]. SI- AM J Sci Comput, 1995,16(2) : 452-469.
  • 2G. L. Miller, Teng Shang Hua, Vavasis S A. A unified geo- metric approach to graph separat ors. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1991 : 538-547.
  • 3G. Karypis, V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs[J]. SIAM J Sci Com put, 1998,20(1) = 359-392.
  • 4G. Karypis, V. Kumar. Multilevel k-way Partitioning Scheme f or Irregular Graphs[J]. J Parallel Distrib Comput, 1998,48 (1) 96 129.
  • 5沈轶炜,曾国荪.异构计算中一种图的非均衡划分算法[J].计算机科学,2006,33(6):260-263. 被引量：7
  • 6杜晓丽,蒋昌俊,徐国荣,丁志军.一种基于模糊聚类的网格DAG任务图调度算法[J].软件学报,2006,17(11):2277-2288. 被引量：48
  • 7张伟哲,胡铭曾,刘凯鹏.基于网络性能的计算网格主机聚类[J].计算机研究与发展,2004,41(12):2135-2140. 被引量：7
  • 8A. Agrawal, H. Casanova. Clustering hosts in P2P and global computing platforms[C]//Proc, of the 3rd IIEE/ACM Int' 1 Symp. On Cluster Computing and the Grid, 2003 , 367-373.
  • 9M. Ester, HP. Kriegel, J. Sander, X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise[C]//Proc, of the 2nd Int 1 Conf. on Knowledge Discovery and Data Mining, 1996 : 226-231.

二级参考文献35

  • 1B Krishnamurthy, J Wang. On network-aware clustering of web clients. In: Proc of the 2000 ACM SIGCOM. New York: ACM Press, 2000
  • 2A Bestavros, S Mehrotra. DNS-based Internet client clustering and characterization. In: Proc of the 4th IEEE Workshop on Workload Characterization (WWC'01). Los Alamitos, CA: IEEE Computer Society Press, 2001
  • 3K P Gummadi, S Saroiu, S Gribble. King: Estimating latency between arbitrary Internet end hosts. In: Proc of SIGCOMM IMW'02. New York: ACM Press, 2002
  • 4S Ratnasamy, M Handley, R Karp, et al. Topologically-aware overlay construction and server selection. In: Proc of IEEE INFOCOM'02. Los Alamitos, CA: IEEE Computer Society Press, 2002
  • 5T S Eugene Ng, H Zhang. Predicting Internet network distance with coordinates-based approaches. In: Proc of IEEE INFOCOM'02. Los Alamitos, CA: IEEE Computer Society Press, 2002
  • 6A Medina, A Lakhina, I Matta, et al. BRITE: An approach to universal topology generation. In: Proc of MASCOTS'01. Los Alamitos, CA: IEEE Computer Society Press, 2001
  • 7W Z Zhang, H L Zhang, H He, et al. Multisite task scheduling on distributed computing grid. In: Proc of the 2nd Int'l Workshop on Grid and Cooperative Computing (GCC 2003). Berlin: Springer, 2003
  • 8H Dail, F Berman, H Casanova. A decoupled scheduling approach for grid application development environments. Journal of Parallel and Distributed Computing, 2003, 63(5): 505～524
  • 9W Z Zhang, B X Fang, H He, et al. Multisite resource selection and scheduling algorithm on computational grid. In: Proc of the 18th Int'l Parallel and Distributed Processing Symposium. Los Alamitos, CA: IEEE Computer Society Press, 2004. 105～115
  • 10T Lee, B Huffaker, M Fomenkov, et al. On the problem of optimization of DNS root servers' placement. In: Proc of the Passive Measurement and Analysis Workshop. Los Alamitos, CA: IEEE Computer Society Press, 2003

共引文献58

计算机与数字工程
2012年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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