A weighted resource discovery approach in grid computing

Abstract

Purpose Grid computing is an effective environment for the execution of parallel applications that requires great computing power. This paper aims to present, based on the hierarchical architecture, an improved weighted resource discovery (WRD) algorithm to manage allocation of resources and minimize cost of communications between grid nodes. Design/methodology/approach A behavioral modeling method is addressed to prove the proposed method correctness. The behavioral model of the proposed algorithm is implemented by StarUML tool with two different model-checking mechanisms. Then, the resource discovery correctness is analyzed in terms of reachability condition, fairness condition and deadlock-free using NuSMV model checker. Findings The results show that WRD algorithm has better performance in requiring re-discovery process, the number of examined nodes in each request and discovering the free resources with high-bandwidth links. Originality/value To store information of resources, a new data structure called resource information table is proposed which facilitates resource finding of the algorithm. A behavioral modeling method is addressed to prove the proposed method correctness.