关键词: 网格计算 资源发现 P2P 二叉树

Abstract:

How to search the resources rapidly and exactly in a distributed, heterogeneous grid environment is the vital dement that affects grid computing perfo  rmance. In this paper, the P2P method is used to deal with the poor scalability of the centralized resource discovery mechanism, and a decentralized res ource discovery method with good scalability is presented. This method uses binary trees to manage data, each node in the grid is responsible for managing a part of the resource information. Experimental results show that the method presented in this paper can resolve many problems that exist in the cen   tralized method, such as poor scalability, heavy load on the resource information server, and single point failures.

Key words: （grid computing, resource discovery, P2P, binary tree）