Abstract: Resource matching, a procedure of Grid task scheduling, aims at finding appropriate resources for Grid tasks according to its requirements. The resource information recorded in Grid Resource Information Service （GRIS） is always static. Because of dynamic characteristic of local jobs arrived in a Grid site, that some of the resources in candidate resource set determined based on static information can not satisfy tasks QoS requirements. This paper predicted resource future status based on its historical dynamic information. Grid task average completion time and distribution of completion time were given. According to tasks QoS requirements and considering both current and future status of a resource, a resource matching model and a matching algorithm were presented. The experimental results show that the algorithm can reduce amount of candidate resource effectively, which can decrease time complexity of a scheduling.

Key words: grid, dynamic, resource matching, matching algorithm

摘要： 网格任务调度过程中的资源匹配是根据任务要求从网格资源信息服务（GRIS）中查找出合适资源的过程。GRIS中记录的往往是资源的静态信息，由于本地负载的动态变化使得基于资源静态信息来确定的候选资源集中一些资源并不能满足任务的QoS需求。基于相关资源动态信息预测资源未来状态，给出了网格任务平均完成时间及完成时间的分布函数，并根据任务QoS需求，兼顾考虑资源当前及未来状态，提出了一种资源匹配模型与匹配算法。通过实验表明，该算法能有效减少候选资源数目，从而降低调度时间复杂度。

关键词: 网格, 动态性, 资源匹配, 匹配算法