基于P2P框架的网格资源发现算法研究  

Resource Discovery Algorithm in Grid Based on P2P Frame

作　　者：郑秀颖[1] 常桂然[2] 田翠华[1] 

机构地区：[1]东北大学信息学院,辽宁沈阳110004 [2]沈阳工程学院信息工程系,辽宁沈阳110136

出　　处：《计算机技术与发展》2008年第5期123-125,130,共4页Computer Technology and Development

基　　金：辽宁省博士学科点专项科研基金(20030145017)

摘　　要：由于资源数量的巨大,典型网格系统中的资源发现问题就成为关键,而现有网格中有许多的资源发现算法主要是集中或分层方法。P2P已经被认为是一种合适的分布式模型,它具有动态性、可伸缩等优点。在现有网格之上提出了一个P2P虚拟层,并据此提出了一个用于网格资源发现的分布式算法,从而解决现有网格系统中资源发现效率低、性能差、不具有伸缩性和可扩展性等一系列问题。Beeause of large amounts of resources, it is very important for resource discovery in grid, but in the existing grid, many resource discovery algorithms are centralized or hierarchical. P2P system has been considered a suitable and distributed paradigm, and it is dynamic, scalable. In this paper, propose a P2P virtual level on the existing grid and based on which provided a distributed grid resource discovery, algorithm, so it can solve a series of problems that existing grid resource discovery algorithm has low efficiency, poor performance, no scalability and no extensibility.

关 键 词：P2P 位图索引 资源发现 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]