High-throughput resource management
The grid
Matchmaking: An extensible framework for distributed resource management
Cluster Computing
On Fully Decentralized Resource Discovery in Grid Environments
GRID '01 Proceedings of the Second International Workshop on Grid Computing
Grids as Production Computing Environments: The Engineering Aspects of NASA's Information Power Grid
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
A Peer-to-Peer Approach to Resource Location in Grid Environments
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
A new mechanism for resource monitoring in Grid computing
Future Generation Computer Systems
A resource discovery tree using bitmap for grids
Future Generation Computer Systems
A resource discovery algorithm with probe feedback mechanism in multi-domain grid environment
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
FRDT: Footprint Resource Discovery Tree for grids
Future Generation Computer Systems
Journal of Systems and Software
Improving learning-based request forwarding in resource discovery through load-awareness
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Behavioral modeling and formal verification of a resource discovery approach in Grid computing
Expert Systems with Applications: An International Journal
Direction-aware resource discovery in large-scale distributed computing environments
The Journal of Supercomputing
| Hi-index | 0.00 |
We present an alternative algorithm of fully decentralized resource discovery in Grid computing, which enables the sharing, selection, and aggregation of a wide variety of geographically distributed computational resources. Our algorithm is based on a simply unicast request transmission that can be easily implemented. The addition of a reservation algorithm is enable resource discovery mechanism to find more available matching resources. The deadline for resource discovery time is decided with time-to-live value. With our algorithm, the only one resource is automatically decided for any request if multiple available resources are found on forward path of resource discovery, resulting in no need to ask user to manually select the resource from a large list of available matching resources. We evaluated the performance of our algorithms by comparing with first-found-first-served algorithm. The experiment results show that the percentages of request that can be supported by both algorithms are not different. However, it can improve the performance of either resource utilization or turnaround time, depending on how to select the resource. The algorithm that finds the available matching resource whose attributes are closest to the required attribute can improve the resource utilization, whereas another one that finds the available matching resource which has the highest performance can improve the turn-around time. However, it is found that the performance of our algorithm relies on the density of resource in the network. Our algorithm seems to perform well only in the environment with enough resources, comparing with the density of requests in the network.