摘要
在动态的网格环境中分布着大量不同类型的服务和资源.快速、准确地进行资源与服务发现,是影响网格计算性能的关键因素,因此,建立了一种基于消息扩散的网格服务发现机制.提出了一种新型的结构化Gossip消息扩散算法,简称为S-Gossip,此算法具有良好的冗余性和完备性.我们详细的描述了此算法及其协议的实现,并在此基础上建立了层次化的服务发现模型.
Grid distributes large numbers, heterogeneous and dynamic resources and services. Resource discovering quickly and accurately is a key problem for the performance of Grid computing. A gird service discovery mechanism based on message dissemination is developed and a new structured message dissemination algorithm is proposed, called structure gossip (S-Gossip) that exhibits stable redundancy and integrality. The implementation of the algorithm and protocol is described in detail and a hierarchical model for resource and service query is built on these.
出处
《山东理工大学学报(自然科学版)》
CAS
2007年第1期43-46,共4页
Journal of Shandong University of Technology:Natural Science Edition