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
| Hi-index | 0.00 |
Resource discovery is a challenging problem in grid computing because computational resources are large-scale geographically distributed. Traditional decentralized resource discovery algorithms often focus on the searching method in forwarding direction. Response message is just used to report the matching node or matching failure. In this paper, a new resource discovery algorithm is introduced. Under this mechanism, request message and corresponding response message may choose different path to destination node. So we add probe feedback mechanism in response message to rediscovery requested resource if the resource can't be found in forwarding path. It provides more chances to satisfy the request. Furthermore, if advance reservation is supported by environment, response message can return the node which can provide matching resource firstly in near future if there are still no suitable resources in rediscovery period. Simulation shows that it can improve the performance of resource discovery especially when the job size is large and turn-around time is not very important to users.