An Analytical Comparison of Rough Set Theorybased Grid Resource Matching Algorithms

Grid environment is an infrastructure in which many heterogeneous resources participate in solving large scale and high computational problems on the internet. Heterogeneity and large number of resources makes resource matching an important issue in the field of grid networks. Recently, rough set theory has been widely considered for efficient resource matching in the literature. In this paper, we analyze and compare three state-of-the-art rough set-based resource matching methods: ROSSE, DRSRD, and CRSRD. These methods are evaluated from the aspects of accuracy and time complexity. The evaluations show ROSSE is fast and has much better performance than DRSRD and CRSRD.