| 基于网格资源可用度的元任务映射算法 |
| |
| 引用本文： | 王勇,戴光明,张霞.基于网格资源可用度的元任务映射算法[J].北京理工大学学报,2011,31(3):303-307. |
| |
| 作者姓名： | 王勇 戴光明 张霞 |
| |
| 作者单位： | 中国地质大学(武汉)计算机科学学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(60873107) |
| |
| 摘 要： | 针对Min-Min启发式算法没有充分考虑网格的异构特性,导致资源负载不均衡的问题,提出一种基于资源可用度的启发式映射算法,在元任务与资源映射过程中,先计算资源对元任务的可用度,然后将元任务划分为优先映射与次优先映射两部分,再对这两组元任务分别应用经典Min-Min算法进行映射.采用仿真软件模拟网格异构环境,在元任务与资源一定的情况下,分别模拟这两种算法的元任务与资源的映射过程,得到这两种情况下的任务完成时间.实验结果表明,基于资源可用度的启发式算法在异构的网格环境中任务完成时间更短.
|
| 关 键 词： | 网格计算 映射 元任务 网格仿真 |
| 收稿时间： | 2009/10/21 0:00:00 |
Meta-Task Mapping Heuristic Based on Serviceability of Grid Resource |
| |
| WANG Yong,DAI Guang-ming and ZHANG Xia.Meta-Task Mapping Heuristic Based on Serviceability of Grid Resource[J].Journal of Beijing Institute of Technology(Natural Science Edition),2011,31(3):303-307. |
| |
| Authors: | WANG Yong DAI Guang-ming and ZHANG Xia |
| |
| Institution: | WANG Yong,DAI Guang-ming,ZHANG Xia(School of Computer Science,China University of Geosciences,Wuhan,Hubei 430074,China) |
| |
| Abstract: | Without taking the heterogeneous grid characteristics into account,Min-Min heuristic can lead to load imbalance.A novel mapping heuristic based on resource's serviceability is proposed in this work.The mapping process is as follows.First,the serviceability of resources to meta-task is calculated and then the meta-task is divided into two groups-prior group and secondary group.Two groups of meta-task are mapped by use of classical Min-Min heuristic,respectively.Under the condition of simulated heterogeneous ... |
| |
| Keywords: | grid computing mapping meta-task grid simulation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
| 点击此处可从《北京理工大学学报》下载免费的PDF全文 |
|
