01494nas a2200109   4500000000100000008004100001100002100042700001800063700001900081245004700100520123700147       2008                            d1 aAntonia Gallardo1 aLuis de Cerio1 aKana Sanjeevan00aHGRID: An Adaptive Grid Resource Discovery3 aGrid Resource Discovery Service is a fundamental problem that has been the focus of research in the recent past. We propose a scheme that presents 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 he 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 - before the routing recovery is processed in order to reconfigure the overlay to avoid non-alive nodes. The results show that the presented approach has significantly high static resilience for a Grid environment.