Abstract: Computational grids provide mechanisms for sharing and accessing large and heterogeneous collections of remote resources such as computers, online instruments, storage space, data and applications. Resources are identified based on attributes. Resource attributes have various degrees of dynamism, form mostly static attributes, like operating system version, to highly dynamic ones, like network bandwidth or CPU load. In this paper we propose a P2P architecture for resource discovery in a large and dynamic collection of resources. We evaluate a set of request-forwarding algorithms in a fully distributed architecture, designed to accommodate heterogeneity (in both sharing policies and resource types) and dynamism. For this, we build a test bed that models two usage characteristics:(1) resource distribution on peer, that varies in the number and the frequency of shared resources; and (2) various requests patterns for resources.

摘要： 网格计算为共享和访问大型且不同种类的远程资源集提供一种机制，例如电脑，联机装置，存储空间，数据和应用程序等资源。这些资源通过属性来标识。资源属性具有各种不同程度的动态性，从静态属性(比如操作系统版本)到高动态性(比如网络带宽或CPU负荷)。在本论文中，我们在P2P体系中进行大型的和动态的资源发现。在非集中式体系中，我们评估一套请求传递算法，该算法被设计成能适应不同资源成分(包括共享策略和资源类型)和动态性。为了达到这个目的，我们建立一个用来模拟两种应用特性的实验平台，这两种特性为：(1)资源按节点分布，而且在共享资源的数量和频率方面也不尽相同：(2)对资源的多种请求模式。