首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于预测的资源匹配算法
引用本文:胡志刚,胡周君. 一种基于预测的资源匹配算法[J]. 计算机应用, 2007, 27(10): 2391-2394
作者姓名:胡志刚  胡周君
作者单位:湖南省中南大学信息科学与工程学院湖南省中南大学信息科学与工程学院
摘    要:网格任务调度过程中的资源匹配是根据任务要求从网格资源信息服务(GRIS)中查找出合适资源的过程。GRIS中记录的往往是资源的静态信息,由于本地负载的动态变化使得基于资源静态信息来确定的候选资源集中一些资源并不能满足任务的QoS需求。基于相关资源动态信息预测资源未来状态,给出了网格任务平均完成时间及完成时间的分布函数,并根据任务QoS需求,兼顾考虑资源当前及未来状态,提出了一种资源匹配模型与匹配算法。通过实验表明,该算法能有效减少候选资源数目,从而降低调度时间复杂度。

关 键 词:网格   动态性   资源匹配   匹配算法
文章编号:1001-9081(2007)10-2391-04
收稿时间:2007-04-04
修稿时间:2007-04-04

Prediction-based resource matching algorithm
HU Zhi-gang,HU Zhou-jun. Prediction-based resource matching algorithm[J]. Journal of Computer Applications, 2007, 27(10): 2391-2394
Authors:HU Zhi-gang  HU Zhou-jun
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.
Keywords:grid  dynamic  resource matching  matching algorithm
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号