| 网格计算中任务的优化分配 |
| |
| 引用本文： | 吴小格,石军南,张兵,汤其丰,邢元军,蔡丽玲. 网格计算中任务的优化分配[J]. 盐城工学院学报(自然科学版), 2007, 20(1): 42-46 |
| |
| 作者姓名： | 吴小格 石军南 张兵 汤其丰 邢元军 蔡丽玲 |
| |
| 作者单位： | 1. 中南林业科技大学,资源与环境学院,湖南,长沙,410004
2. 上海大学,通信与信息工程学院,中国,上海,200072 |
| |
| 摘 要： | 网格计算是一种新兴技术,有很多的优点,也有亟待解决的问题。阐述了网格计算的基本概念及其几个关键性问题,就网格计算中任务分配问题,着重考虑工作完成时间和所耗成本,提出了A*R和OASS两种算法,并对测试结果进行了分析比较。
|
| 关 键 词： | 网格计算 任务分配 A*R算法 OASS算法 |
| 文章编号： | 1671-5322（2007）01-0042-05 |
| 收稿时间： | 2006-12-07 |
| 修稿时间： | 2006-12-07 |
Optimal Task Assignment in Grid Computing |
| |
| WU Xiao-ge,SHI Jun-nan,ZHANG Bing,TANG Qi-feng,XING Yuan-jun,CAI Li-ling. Optimal Task Assignment in Grid Computing[J]. Journal of Yancheng Institute of Technology(Natural Science Edition), 2007, 20(1): 42-46 |
| |
| Authors: | WU Xiao-ge SHI Jun-nan ZHANG Bing TANG Qi-feng XING Yuan-jun CAI Li-ling |
| |
| Affiliation: | 1.School of Resource and Environment,Central South University of Forestry and Technology,Hunan Changsha 410004,China;2.School of Communication and Information,Shanghai University,Shanghai 200072,China |
| |
| Abstract: | Grid computing is a rising techniquewhich has many advantages and problems as well.This article elaborated the basic concept of grid computing and several decisive problems.As to the problem of task assignment in grid computing,the paper considered the time completing workload and the consuming cost,putting forward two algorithms of A*R and OASS.Finally the results of the test were analyzed and compared. |
| |
| Keywords: | grid computing task assignment A*R algorithm OASS algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《盐城工学院学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《盐城工学院学报(自然科学版)》下载全文 |
|
