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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gallardo, A., Díaz De Cerio, L., & Sanjeevan, K. (2008). Self-configuring resource discovery on a hypercube grid overlay. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5168 LNCS, pp. 510–519). https://doi.org/10.1007/978-3-540-85451-7_55
Mendeley helps you to discover research relevant for your work.