On Fully Decentralized Resource Discovery in Grid Environments
GRID '01 Proceedings of the Second International Workshop on Grid Computing
HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Grid resource management: state of the art and future trends
Grid resource management: state of the art and future trends
A Hyper-cube based P2P Information Service for Data Grid
GCC '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing
DGRID: a DHT-based resource indexing and discovery scheme for computational grids
ACSW '07 Proceedings of the fifth Australasian symposium on ACSW frontiers - Volume 68
HyperBone: A Scalable Overlay Network Based on a Virtual Hypercube
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
HGRID: An Adaptive Grid Resource Discovery
CISIS '08 Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems
| Hi-index | 0.00 |
Grid 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 search algorithm. The algorithm improves the probability of reaching all working nodes in the system even in the presence of non-alive nodes (inaccessible, crashed or heavy 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.