Best resource node selection using rough sets theory

In Grid computing, the problem of selecting resources to specific jobs can be very complex, and may require co-allocation of different resources such as specific amount of CPU hours, system memory and network bandwidth for data transfer, etc. Because of the lack of centralized control and the dynamic nature of resource availability, any successful selection mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have a selection mechanism that does not rely on the availability of coherent global information. This paper considers selection method in grid environment using rough set theory, which could select the best node in grid environment. The proposed method is designed to achieve the following goals: handling large number of incoming requests simultaneously; assigning each service efficiently to all the incoming requests; selecting the appropriate services for the incoming requests within a reasonable time. Random data is used to test the validity of proposed method in this paper. The result showed that this method can provide the suitable probability of the best node selection.