网格计算中任务的优化分配

Optimal Task Assignment in Grid Computing

网格计算是一种新兴技术,有很多的优点,也有亟待解决的问题。阐述了网格计算的基本概念及其几个关键性问题,就网格计算中任务分配问题,着重考虑工作完成时间和所耗成本,提出了A*R和OASS两种算法,并对测试结果进行了分析比较。

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 resuits of the test were analyzed and compared .