一种分层式计算网格资源定位路由协议

A Hierarchical Computaional Grid Resource Locating Routing Protocol

计算网格是一种新兴的高性能计算技术 .计算网格系统包含各种计算资源 .这些资源具有动态变化、广域分布和异构系统等特征 .这些特征给网格资源定位提出了新的挑战 .文中运用层次结构的思想提出了一种分层式网格资源模型 ;以该模型为基础设计了一种基于离散动态规划原理的分层式网格资源定位路由 ( H GRL R)协议 .在该协议中 ,计算网格的资源可按节点所分布的地理区域、连通性以及节点之间的相关性等因素进行分簇 ( cluster) ,各节点只需维护局部路由信息及网格资源簇结构的主要信息 ,它能实现网格资源请求的路由和转发 ,并将资源请求转发给满足此请求的计算资源 ,能适应计算网格资源结构的动态变化 ,可有效地解决计算网格资源发现及定位问题 .文中描述了 HGRLR协议的主要模块 。

Computational grid is a burgenoing high performance computing technique. A computational grid system consists of various resources. These resources have some features of dynamic change, geographical dispersion and heterogeneous systems, which present new challenges for grid vesource locating. In this paper, the layered grid resource model is built up according to the layered idea. On the basis of this model, a hierarchical grid resource locating routing (HGRLR) protocol based on the discrete dynamic programming principle is presented. In general, the clustering problem of computational grid resource depends on the geographical location of nodes, connectivity as well as the relativity between nodes. Each resource node only remains local routing information and main information of clustering structure of grid resources. The protocol can select route for grid resource request and forward the request to the computing resource node which can satisfy the request. HGRLR protocol can dynamically adapt to changes of grid resource structures. This routing protocol can effectively solve the problems of grid resources discovery and location. The main module procedures for realizing routing protocol are presented. The proof of correctness and complexity analysis of the protocol are also made.