云计算环境下基于关联量的数据部署与任务调度  

Data placement and task scheduling based on associated amount in cloud computing

作　　者：郭力争[1,2] 赵曙光[1] 姜长远[1] 

机构地区：[1]东华大学信息学院,上海201620 [2]河南城建学院计算机科学与工程系,河南平顶山467036

出　　处：《计算机工程与科学》2013年第8期1-7,共7页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(70971020);河南省教育厅科学技术研究重点项目(12A520006)

摘　　要：科学工作流处理的问题复杂,依赖于集群或网格平台,云计算的出现为科学工作流又提供了一个可供选择的平台;云计算环境下数据密集型应用的科学工作流处理和传输的数据量巨大,减少数据中心不同集群间数据的传输次数和传输量是个挑战性的问题。科学工作流要处理的数据间存在依赖关系,基于数据间的依赖关系最大关联量建立关联矩阵,通过键能算法对关联矩阵进行聚类,把最大相关的数据聚集到一起,然后通过K分割方法,把聚类矩阵分割为k个部分,每个部分部署到数据中心相关的集群里。仿真结果表明,本方法能有效地减少数据中心不同集群间数据的移动次数和移动量。In scientific workflows, cluster or grid platform is used to deal with complex problems, and the emergence of cloud computing offers an alternative. The transferred data are huge in the data-in- tensive scientific workflows in cloud computing. Reducing the count and amount of the data transfers be- tween different clusters in a dataeenter is a challenging problem. There exists dependency in data of the scientific workflow. Firstly, a relational matrix is built based on the associate amount. Secondly, the re- lational matrix is clustered using bond energy algorithm. Thirdly, the clustered matrix is partitioned to k parts and each part is deployed to corresponding clusters in the datacenter. The simulation results show that the proposed method reduces the count and amount of the data transfers between clusters in a datacenter.

关 键 词：云计算 关联量 键能算法 数据部署 任务调度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]