基于运行时间权矩阵的网格服务匹配问题的优化解

Optimized solution to the grid services matchmaking problem based on running time weight matrix

为解决在网格环境下满足用户作业对完成时间需求的服务资源调度问题,建立了包括独立匹配器在内的服务网格三元模型,给出了该模型基于图论的形式化描述,证明了用户作业和服务资源之间完备匹配的充分必要条件.同时构造了基于传感器反馈的网格服务匹配系统,给出了基于运行时间权矩阵的优化问题描述,并给出了基于离散事件动态系统理论的最优化解算法.仿真研究表明,该算法比其他算法更能改善网格服务匹配系统的性能指标,在满足服务资源负载均衡的同时提供了用户作业完成时间的服务质量保证.

In order to solve the resource scheduling problem in service grid environment to guarantee the need of user jobs complete time, an independent matchmaker was introduced into the three-element service grid model. The service grid model was formally illustrated based on the graph theory, and the necessary and sufficient conditions of complete match of user jobs and grid service resources were also proved. A grid services matchmaking system was constructed on the base of sensor feedback. The optimal matchmaking problem of the system was formally illustrated based on the running time weight matrix, and the optimal solution arithmetic was proposed based on the discrete event dynamic system theory. Simulation analysis shows that the arithmetic can improve the QoS （quality of services） performance parameter of the grid services matchmaking system, provide the user jobs completed time guarantee and meet the load balance need of grid service resources.