Optimized solution to the grid services matchmaking problem based on running time weight matrix
-
摘要: 為解決在網格環境下滿足用戶作業對完成時間需求的服務資源調度問題,建立了包括獨立匹配器在內的服務網格三元模型,給出了該模型基于圖論的形式化描述,證明了用戶作業和服務資源之間完備匹配的充分必要條件.同時構造了基于傳感器反饋的網格服務匹配系統,給出了基于運行時間權矩陣的優化問題描述,并給出了基于離散事件動態系統理論的最優化解算法.仿真研究表明,該算法比其他算法更能改善網格服務匹配系統的性能指標,在滿足服務資源負載均衡的同時提供了用戶作業完成時間的服務質量保證.Abstract: 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.
-
Key words:
- service grid /
- matchmaker /
- complete match /
- weight matrix /
- discrete event dynamic system theory /
- graph theory
-

計量
- 文章訪問數: 131
- HTML全文瀏覽量: 39
- PDF下載量: 6
- 被引次數: 0