HGRID: An Adaptive Grid Resource Discovery

Abstract

Grid Resource Discovery Service is a fundamental problem that has been the focus of research in the recent past. We propose a scheme that has essential characteristics for efficient, self-configuring and fault-tolerant resource discovery and is able to handle dynamic attributes, such as memory capacity. Our approach consists of an overlay network with a hypercube topology connecting the grid nodes and a scalable, fault-tolerant, self-configuring and adaptive search algorithm. Every grid node keeps a small routing table of only log2N entries. The search algorithm is executed in less than (log2N +1) time steps and each grid node is queried only once. By design, the algorithm improves the probability of reaching all working nodes in the system even in the presence of non-alive nodes (inaccessible, crashed or heavily loaded nodes). We analyze the static resilience of the approach presented, which is the measure of how well the algorithm can discover resources without having to update the routing tables. This is done before the routing recovery is processed in order to reconfigure the overlay to avoid non-alive nodes. The results show that our approach has a significantly high static resilience for a Grid environment.